数据结构2-栈

 1 class stack(object):
 2     def __init__(self):
 3         self.items=[]
 4 
 5     def is_empty(self):
 6         if len(self.items)>0:
 7             return False
 8         return True
 9 
10     def add(self,item):
11         self.items.append(item)
12 
13     def push(self):
14         return self.items.pop()
15 
16     def peek(self):
17         return self.items[len(self.items)-1]
18 
19     def size(self):
20         return len(self.items)

1 if __name__="__main__":
2     st=stack()
3     st.add("a")
4     st.add("b")
5     st.add("c")
6     print(st.peek())
7     print("--"*5)        
8     print(st.size())
9     print("--"*5)
10     print(st.push)

 

转载于:https://www.cnblogs.com/Dai-py/p/10820302.html