[数据结构][Python]实现stack和queue

野性酷女 2022-01-23 13:21 205阅读 0赞

栈：

class Stack(object):
    
        def __init__(self,size):
            self.size=size
            self.stack = []
            self.top = -1
        def push(self,item):
            if self.is_full():
                raise Exception("stack is full")
            else:
                self.stack.append(item)
                self.top +=1
        def pop(self):
            if self.is_empty():
                raise Exception("stack is empty")
            else:
                self.top -= 1
                self.stack.pop()
        def is_full(self):
            return self.top+1 == self.size
        def is_empty(self):
            return self.top==-1
        def show_stack(self):
            print(self.stack)
    s = Stack(10)
    for i in range(6):
        s.push(i)  # 入栈
    s.show_stack()  # [0, 1, 2, 3, 4, 5]
    s.pop()
    s.show_stack()

队列：

class Queue(object):
        def __init__(self,size):
            self.size = size
            self.queue = []
            self.top = -1
        def dequeue(self,item):
            if self.is_full():
                raise Exception("queue is full")
            else:
                self.queue.append(item)
                self.top +=1
        def enqueue(self):
            if self.is_empty():
                raise Exception("queue is empty")
            else:
                self.queue.pop(0)
                self.top -=1
        def clear(self):
            del self.queue
        def is_full(self):
            return self.top+1==self.size
        def is_empty(self):
            return self.top==-1
        def show_queue(self):
            print(self.queue)
    
    sq = Queue(20)
    for i in range(9, 20):
        sq.dequeue(i)
    
    sq.show_queue()
    
    sq.enqueue()
    sq.show_queue()