Ryan’s leetcode Blog
显示标签为“
datastructure
”的博文。
显示所有博文
显示标签为“
datastructure
”的博文。
显示所有博文
2015年10月22日星期四
Implement Stack using Queues leetcode
›
mplement the following operations of a stack using queues. push(x) -- Push element x onto stack. pop() -- Removes the element on top of ...
2015年10月5日星期一
Two Sum III - Data structure design leetcode
›
Design and implement a TwoSum class. It should support the following operations: add and find . add - Add the number to an internal d...
2015年6月25日星期四
Insert Interval leetcode
›
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the interv...
Merge Intervals leetcode
›
Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18] , return [1,6],[8,10]...
2015年5月20日星期三
LRU Cache
›
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set . g...
›
主页
查看网络版本