| 36 | |
| 37 | # 设计一个良策都能插入删除的队列deque |
| 38 | class Deque: |
| 39 | def __init__(self): |
| 40 | self.items = [] |
| 41 | |
| 42 | def isEmpty(self): |
| 43 | return self.items == [] |
| 44 | |
| 45 | def addRear(self, item): |
| 46 | self.items.insert(0, item) |
| 47 | |
| 48 | def addFront(self, item): |
| 49 | self.items.append(item) |
| 50 | |
| 51 | def removeFront(self): |
| 52 | return self.items.pop() |
| 53 | |
| 54 | def removeRear(self): |
| 55 | return self.items.pop(0) |
| 56 | |
| 57 | def size(self): |
| 58 | return len(self.items) |
| 59 | |
| 60 | # 利用Deque解决回文字符串 |
| 61 | def palcheker(aString): |