Stack / Queue
文章平均质量分 73
beiyetengqing
http://blog.csdn.net/beiyeqingteng 的镜像站
展开
-
implement a queue by using two stacks
For a queue, we need to implement enqueue and dequeue methods.The idea is if we perform enqueue operation, we simply put that input into the stack 1 by performing the push operation; when we perfo原创 2012-08-29 10:02:32 · 1052 阅读 · 1 评论 -
return the minimum value in a stack
Implement a stack which not only has push, pop, but also is able to return the minimum value within O(1) time.public class StackWithMin { Stack stack1 = new Stack(); Stack stack2 = new Stack();原创 2012-10-05 08:27:40 · 704 阅读 · 0 评论 -
逆波兰表示法
前言:在逆波兰记法中,操作符置于操作数的后面。例如表达“三加四”时,写作“3 4 +”,而不是“3 + 4”。如果有多个操作符,操作符置于第二个操作数的后面,所以常规中缀记法的“3 - 4 + 5”在逆波兰记法中写作“3 4 - 5 +”:先3减去4,再加上5。使用逆波兰记法的一个好处是不需要使用括号。例如中缀记法中“3 - 4 * 5”与“(3 - 4)*5”不相同,但后缀记法中前者写做原创 2012-10-13 10:13:08 · 13893 阅读 · 2 评论 -
quickly find the median of a sequence of numbers
Question:Assume the user can enter a large sequence of integer numbers, please return the median of the entered numbers.Idea: Create an min-heap and max-heap, and save the entered number to the原创 2013-11-02 06:37:58 · 1014 阅读 · 0 评论