用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
1、方法一:
class CQueue:
def __init__(self):
self.li = []
def appendTail(self, value: int) -> None:
self.li.append(value)
def deleteHead(self) -> int:
if len(self.li) == 0:
return -1
v = self.li[0]
self.li = self.li[1:]
return v
# Your CQueue object will be instantiated and called as such:
# obj = CQueue()
# obj.appendTail(value)
# param_2 = obj.deleteHead()
2、方法二:采用两个列表(K神方法)
class CQueue:
def __init__(self):
self.li = []
self.li2 = []
def appendTail(self, value: int) -> None:
self.li.append(value)
def deleteHead(self) -> int:
if self.li2:
return self.li2.pop()
if len(self.li) == 0:
return -1
while self.li:
self.li2.append(self.li.pop())
return self.li2.pop()