一个先进后出的栈。
| 22 | |
| 23 | |
| 24 | class Stack: |
| 25 | """ |
| 26 | 一个先进后出的栈。 |
| 27 | """ |
| 28 | def __init__(self): |
| 29 | """ |
| 30 | 这里用实例对象。 |
| 31 | """ |
| 32 | self.stored = deque() |
| 33 | |
| 34 | def __repr__(self): |
| 35 | # 3.6 + |
| 36 | return f'<{self.stored}>' |
| 37 | |
| 38 | def push(self, value): |
| 39 | self.stored.append(value) |
| 40 | |
| 41 | def pop(self): |
| 42 | return self.stored.pop() |
| 43 | |
| 44 | def get_top(self): |
| 45 | """ |
| 46 | 查看栈顶的数据但不压出。 |
| 47 | """ |
| 48 | return self.stored[-1] |
| 49 | |
| 50 | def empty(self): |
| 51 | if self.stored: |
| 52 | return False |
| 53 | return True |
| 54 | |
| 55 | |
| 56 | class MinStack(Stack): |
no outgoing calls
no test coverage detected