python数据结构第4天

栈的python实现

class stack:

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

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

    def push(self,item):
        self.items.append(item)

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

    def peek(self):
        return self.items[len(self.items)-1]

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

if __name__=='__main__':
    s=stack()
    s.push('hello')
    s.push('world')
    s.push('itcast')
    print(s.size())
    print(s.peek())
    s.pop()
    print(s.peek())
    s.pop()
    s.pop()

3
itcast
world

队列的实现

class Queue:

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

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

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

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


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

if __name__=='__main__':
    q = Queue()
    q.enqueue("hello")
    q.enqueue("world")
    q.enqueue("itcast")
    print(q.size())
    q.dequeue()
    q.dequeue()
    q.dequeue()
    print(q.size())

3
0

双端队列
双端队列中的元素可以从两端弹出，其限定插入和删除操作在表的两端进行。双端队列可以在队列任意一端入队和出队。

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

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

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

    def add_rear(self, item):
        self.items.append(item)

    def remove_front(self):
        return self.items.pop(0)

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

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


if __name__ == "__main__":
    deque = Deque()
    deque.add_front(1)
    deque.add_front(2)
    deque.add_rear(3)
    deque.add_rear(4)
    print(deque.size())
    deque.remove_front()
    deque.remove_front()
    deque.remove_rear()
    deque.remove_rear()
    print(deque.size())

4
0