03_python_deque

用python实现双端队列

• 采用List实现
  • List下标0作为双端队列的尾端；List下标-1作为双端队列的首端
  • addFront()/removeFront()函数操作复杂度为：O(1)
  • addRear()/removeRear()函数操作复杂度为：O(n)

class Deque:
    def __init__(self):
        self.items = []
    
    def isEmpty(self):
        return self.items == []
    
    def  addFront(self, item):
        self.items.append(item)
        
    def addRear(self, item):
        self.items.insert(0, item)
    
    def removeFront(self):
        return self.items.pop()
    
    def removeRear(self):
        return self.items.pop(0)
    
    def size(self):
        return len(self.items)
    
d = Deque()
d.addRear(4)
d.addRear('dog')
d.addFront('cat')
d.addFront(True)
print(d.size())
d.addRear(8.4)
print(d.removeRear())
print(d.removeFront())
print(d.isEmpty())

4
8.4
True
False

回文词判定

• 回文词指正读和反读都是一样的词，如radar、山东落花生花落山东
• 用双端队列解决回文词问题
  • 先将需要判定的词从队尾加入deque
  • 从两端同时移除字符判定是否相同，直到deque中剩下0个或1个字符

class Deque:
    def __init__(self):
        self.items = []
    
    def isEmpty(self):
        return self.items == []
    
    def  addFront(self, item):
        self.items.append(item)
        
    def addRear(self, item):
        self.items.insert(0, item)
    
    def removeFront(self):
        return self.items.pop()
    
    def removeRear(self):
        return self.items.pop(0)
    
    def size(self):
        return len(self.items)
    
def palchecker(aString):
    chardeque = Deque()
    for ch in aString:
        chardeque.addRear(ch)
        
    stillEqual = True
    
    while chardeque.size() > 1 and stillEqual:
        first = chardeque.removeFront()
        last = chardeque.removeRear()
        if first != last:
            stillEqual = False
    return stillEqual

print(palchecker('lsdkjfskf'))
print(palchecker('radar'))

False
True