1 题目
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof
2 解题思路
栈:数据是先进后出;
队列:数据是先进先出。
来源:https://www.bilibili.com/video/BV1CK411c7gx?p=6
3 代码实现
class CQueue(object):
def __init__(self):
self.stack1 = []
self.stack2 = []
def appendTail(self, value):
"""
:type value: int
:rtype: None
"""
self.stack1.append(value)
def deleteHead(self):
"""
:rtype: int
"""
if self.stack2 ==[]:
while self.stack1 !=[]:
self.stack2.append(self.stack1.pop())
if self.stack2 !=[]:
return self.stack2.pop()
else:
return -1