leetcode之Implement Queue using Stacks
来源:互联网 发布:寿百年黑俄罗斯淘宝店 编辑:程序博客网 时间:2024/05/16 06:53
这道题就是实现栈的操作。用list来实现,很简单的。代码如下:
class Queue(object): def __init__(self): """ initialize your data structure here. """ self.items = [] def push(self, x): """ :type x: int :rtype: nothing """ self.items.append(x) def pop(self): """ :rtype: nothing """ del self.items[0] def peek(self): """ :rtype: int """ return self.items[0] def empty(self): """ :rtype: bool """ if len(self.items) == 0: return True else: return False
0 0
- 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
- 背包问题(物体可分割)
- 网关、路由器的区别
- java hashtable 和 hashmap的区别
- 信管专业毕业生的尴尬
- 游戏系统开发笔记(序)——因由、感想与目的
- leetcode之Implement Queue using Stacks
- Android toolbar 随笔
- 关于第二阶段
- ZOJ.2679 Old Bill【水】 2015/10/12
- HDOJ 题目5501 The Highest Mark(贪心+01背包变形)
- Scala学习笔记16【Scala闭包代码实例】
- ios学习之自定义窗口的激活
- [Leetcode]Convert Sorted List to Binary Search Tree
- Java考题