Design
konsy_dong
Java,C++,Python,linux
展开
-
LeetCode 232. Implement Queue using Stacks
题目: Implement the following operations of a queue using stacks.push(x) – Push element x to the back of queue. pop() – Removes the element from in front of queue. peek() – Get the front element. emp原创 2017-04-05 09:27:22 · 312 阅读 · 0 评论 -
LeetCode 155. Min Stack
题目: Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() –原创 2017-04-07 16:32:08 · 223 阅读 · 0 评论 -
LeetCode 225. Implement Stack using Queues
题目描述: Implement the following operations of a stack using queues.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the top element. empty() – Return原创 2017-04-10 15:18:08 · 222 阅读 · 0 评论