数据结构与算法python北大版笔记 -队列

队列

1.Python实现队列(ADT Queue)

​ 采用List来容纳Queue的数据项

​ 将List首端作为队列尾端，List末端作为队列首端，enqueue()复杂度为O(n),dequeue()复杂度为O(1)。(首尾倒过来实现，复杂度也倒过来)

class Queue:
    def __init__(self):
        self.items = []

    def isEmpty(self):
        return self.items == []

    def enqueue(self, item):
        self.items.insert(0, item)

    def dequeue(self):
        return self.items.pop()

    def size(self):
        return len(self.items)

测试代码：

q = Queue()
print(q.isEmpty())
q.enqueue(4)
q.enqueue("dog")
q.enqueue(True)
print(q.size())
print(q.dequeue())

测试结果：

2.队列的应用

1）热土豆问题

2）打印机问题

3.Python实现双端队列(ADT Deque)

采用List实现

• ​ List下标0作为deque的尾端
• ​ List下标-1作为deque的首端

操作复杂度

• ​ 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)
  

测试代码：

q = Deque()
print(q.isEmpty())
q.addFront(4)
q.addFront("dog")
q.addRear(True)
print(q.size())
print(q.removeFront())
print(q.removeRear())
print(q.size())

测试结果：

4.双端队列的应用

1）回文词的判断

算法思想：先将需要判定的词从队尾加入deque,再从两端同时移除字符判定是否相同，直到deque中剩下0个或1个字符

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("sfsfsdfwe")) #False
print(palchecker("radar")) #True