刷题第九天 232.栈实现队列 225.队列实现栈

232. 栈实现队列

class MyQueue(object):

    def __init__(self):
        self.list = []
        self.size = 0
    def push(self, x):
        self.list.append(x)
        self.size += 1

    def pop(self):
        top = self.list[0]
        self.list = self.list[1:]
        self.size -= 1
        return top

    def peek(self):
        return self.list[0]


    def empty(self):
        return self.size == 0

225. 队列实现栈

class MyStack(object):

    def __init__(self):
        self.list = []
        self.size = 0
    def push(self, x):
        self.list.append(x)
        self.size += 1

    def pop(self):
        num = self.list[-1]
        self.list = self.list[:-1]
        self.size -= 1
        return num
        
    def top(self):
        return self.list[-1]

    def empty(self):
        return self.size == 0