python 两个栈实现链表

两个栈实现链表

#-*- coding:utf-8 -*-
class StackForList():
    def __init__(self):
    #先把node存进stack1中，而输出时从stack2中出去
        self.stack1 = []
        self.stack2 = []

    def push(self,node):
        self.stack1.append(node)

    def pop(self):
        if len(self.stack2) != 0:
        #stack2不为空，则直接对stack2进行pop
            return self.stack2.pop()
        elif len(self.stack1) !=0 :
        #若stack2为空，先把stack1所有数据从尾到头导入stack2
            while len(self.stack1):
                self.stack2.append(self.stack1.pop())
            return self.stack2.pop()
        else:
            return None

#测试用例
listhandle=StackForList()
listTest=[1,2,3,4]
for count in range(2):
#执行两次，第一次验证stack2为空，第二次验证stack2不为空的情况
    for node in listTest:
        listhandle.push(node)
    for i in range(2):
        print 'stack1:%-15s' %listhandle.stack1,
        print 'stack2:%-15s' %listhandle.stack2
        print 'pop:',listhandle.pop()
#执行输出
>>> 
stack1:[1, 2, 3, 4]    stack2:[]             
pop: 1
stack1:[]              stack2:[4, 3, 2]      
pop: 2
stack1:[1, 2, 3, 4]    stack2:[4, 3]         
pop: 3
stack1:[1, 2, 3, 4]    stack2:[4]            
pop: 4