| 1 | # Python3.5 |
| 2 | # 定义一个栈类 |
| 3 | class Stack(): |
| 4 | # 栈的初始化 |
| 5 | def __init__(self): |
| 6 | self.items = [] |
| 7 | # 判断栈是否为空,为空返回True |
| 8 | def isEmpty(self): |
| 9 | return self.items ==[] |
| 10 | # 向栈内压入一个元素 |
| 11 | def push(self, item): |
| 12 | self.items.append(item) |
| 13 | # 从栈内推出最后一个元素 |
| 14 | def pop(self): |
| 15 | return self.items.pop() |
| 16 | # 返回栈顶元素 |
| 17 | def peek(self): |
| 18 | return self.items[len(self.items)-1] |
| 19 | # 判断栈的大小 |
| 20 | def size(self): |
| 21 | return len(self.items) |
| 22 | |
| 23 | # 栈属性测试 |
| 24 | # 测试数据 |
no outgoing calls
no test coverage detected