Leetcode: Implement Queue using Stacks
来源:互联网 发布:千牛 mac 账号不存在 编辑:程序博客网 时间:2024/05/01 20:01
Question
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.
empty() – Return whether the queue is empty.
Notes:
You must use only standard operations of a stack – which means only push to top, peek/pop from top, size, and is empty operations are valid.
Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).
Show Tags
Show Similar Problems
Solution
code
class Queue(object): def __init__(self): """ initialize your data structure here. """ self.stack1 = [] self.stack2 = [] def push(self, x): """ :type x: int :rtype: nothing """ self.stack1.append(x) def pop(self): """ :rtype: nothing """ if self.stack2!=[]: self.stack2 = self.stack2[0:-1] else: while self.stack1!=[]: temp = self.stack1[-1] self.stack2.append(temp) self.stack1 = self.stack1[0:-1] if self.stack2!=[]: self.stack2 = self.stack2[0:-1] def peek(self): """ :rtype: int """ res = None if self.stack2!=[]: res = self.stack2[-1] #self.stack2 = self.stack2[0:-1] else: while self.stack1!=[]: temp = self.stack1[-1] self.stack2.append(temp) self.stack1 = self.stack1[0:-1] if self.stack2!=[]: res = self.stack2[-1] #self.stack2 = self.stack2[0:-1] return res def empty(self): """ :rtype: bool """ return len(self.stack1)==0 and len(self.stack2)==0
Take home message
peek(): don not need to remove the front elements. All need to do is to return the value of the first element.
- leetcode :Implement Queue using Stacks
- [LeetCode] Implement Queue using Stacks
- LeetCode Implement Queue using Stacks
- LeetCode || Implement Queue using Stacks
- leetcode Implement Queue using Stacks
- Leetcode Implement Queue using Stacks
- [LeetCode]Implement Queue using Stacks
- 【Leetcode】Implement Queue using Stacks
- LeetCode Implement Queue using Stacks
- Leetcode: Implement Queue using Stacks
- [leetcode] Implement Queue using Stacks
- 【leetcode】Implement Queue using Stacks
- [Leetcode]Implement Queue using Stacks
- [leetcode] Implement Queue using Stacks
- LeetCode-Implement Queue using Stacks
- LeetCode Implement Queue using Stacks
- Leetcode: Implement Queue using Stacks
- LeetCode:Implement Queue using Stacks
- solrCloud分布式检索流程图
- 浅谈Java中的Scanner类
- 自定义异步可插入协议 (代码记录)
- Java____父类、子类——构造代码块、方法调用顺序问题
- 让DIV高度自适应
- Leetcode: Implement Queue using Stacks
- java.lang.NoSuchMethodError: android.view.ViewTreeObserver.removeOnGlobalLay的解决方案
- 互斥量和信号量的区别
- eXtreme Table 说明
- 新手向linux/ubuntu下的node.js安装
- mysql常用命令
- 常规功能和模块自定义系统(cfcmms)—004可自定义的项目
- linux:正则表达式基础
- ListView 点击无效(转)