算法工程师14.1——力扣刷题基本题

1 栈、队列

1.1 栈的实现

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

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

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

    def pop(self):
        return self.items.pop()   # 删除最后一个元素

    def peek(self):
        return self.items[len(self.items)-1] # 产看栈顶元素

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

1.2 队列的实现

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

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

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

    def pop(self):
        return self.items.pop(0)   # 出队列

    def peek(self):
        return self.items[0] # 产看栈顶元素

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

1.3 双向队列

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

    def isEMpty(self):