python 栈和队列的区别_Python 栈与队列

一、栈：

#栈的实现，先进后出

class Stack(object):

def __init__(self):

self.__list = []

def push(self,item):

self.__list.append(item)

def pop(self):

return self.__list.pop()

#返回栈顶元素

def peek(self):

if self.__list:

return self.__list[-1]

else:

return None

def is_empty(self):

return self.__list == []

def size(self):

return len(self.__list)

if __name__ == '__main__':

s = Stack()

二、队列：

#队列实现，先进先出

class Queue(object):

def __init__(self):

self.__list = []

def enqueue(self,item):

self.__list.append(item)

def dequeue(self):

return self.__list.pop(0)

def is_empty(self):

return self.__list == []

def size(self):

return len(self.__list)

if __name__ == '__main__':

q = Queue()