题解 | #用两个栈实现队列#
用两个栈实现队列
http://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6
-- coding:utf-8 --
class Solution: def init(self): self.stack1 = [] self.stack2 = [] def push(self, node): # write code here self.stack1.append(node) def pop(self): # return xx if (len(self.stack2) == 0): while (len(self.stack1) != 0): self.stack2.append(self.stack1.pop()) return self.stack2.pop()