题目:
面试题 03.01. 三合一。
三合一。描述如何只用一个数组来实现三个栈。
你应该实现push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum)方法。stackNum表示栈下标,value表示压入的值。
构造函数会传入一个stackSize参数,代表每个栈的大小。
链接:https://leetcode.cn/problems/three-in-one-lcci
示例:
输入:
[“TripleInOne”, “push”, “push”, “pop”, “pop”, “pop”, “isEmpty”]
[[1], [0, 1], [0, 2], [0], [0], [0], [0]]
输出:
[null, null, null, 1, -1, -1, true]
说明:当栈为空时pop, peek
返回-1,当栈满时push
不压入元素。
输入:
[“TripleInOne”, “push”, “push”, “push”, “pop”, “pop”, “pop”, “peek”]
[[2], [0, 1], [0, 2], [0, 3], [0], [0], [0], [0]]
输出:
[null, null, null, null, 2, 1, -1, -1]
提示: 0 <= stackNum <= 2
思路:
先创建三合一列表,再针对每个列表分别实现。
代码:
class TripleInOne:
def __init__(self, stackSize: int):
self.stack = [[] for i in range(3)]
self.stackSize = stackSize
def push(self, stackNum: int, value: int) -> None:
if len(self.stack[stackNum]) < self.stackSize:
self.stack[stackNum].append(value)
def pop(self, stackNum: int) -> int:
return self.stack[stackNum].pop() if self.stack[stackNum] else -1
def peek(self, stackNum: int) -> int:
return self.stack[stackNum][-1] if self.stack[stackNum] else -1
def isEmpty(self, stackNum: int) -> bool:
return not self.stack[stackNum]
# Your TripleInOne object will be instantiated and called as such:
# obj = TripleInOne(stackSize)
# obj.push(stackNum,value)
# param_2 = obj.pop(stackNum)
# param_3 = obj.peek(stackNum)
# param_4 = obj.isEmpty(stackNum)