【剑指offer】JZ9 用两个栈实现队列

题目

python题解

python的列表结合append和pop方法就可以看作是一个栈。

# -*- 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 self.stack2:
            return self.stack2.pop()
        else:
            for i in range(len(self.stack1)):
                self.stack2.append(self.stack1.pop())
            return self.stack2.pop()

if __name__ == '__main__':
    solution = Solution()
    solution.push(1)
    solution.push(2)
    print(solution.pop())
    print(solution.pop())

结果

1
2