# -*- coding:utf-8 -*- # 队列的实现 class Queue(object): def __init__(self): self.dataList = [] def initQueue(self): self.dataList = [] def insert(self, data): self.dataList.append(data) def pop(self): if len(self.dataList) == 0: return None data = self.dataList[0] del self.dataList[0] # 删除列表中的元素 return data def size(self): return len(self.dataList) queue = Queue() # print queue.size() queue.insert(1) queue.insert(2) queue.insert(3) head = queue.pop() # print head head = queue.pop() # print head head = queue.pop() # print head head = queue.pop() # print head # 栈的实现 class Stack(object): def __init__(self): self.dataStack = [] def insert(self, data): self.dataStack.append(data) def pop(self): if len(self.dataStack) == 0: return None data = self.dataStack[-1] # 用-1 访问列表中最后一项 del self.dataStack[-1] return data def size(self): return len(self.dataStack) stack = Stack() stack.insert(1) stack.insert(2) stack.insert(3) # print stack.pop() # print stack.pop() # print stack.pop() # print stack.pop()
分类: Python
0 条评论