数据结构之双向队列

#/usr/bin/env python2.7
# -*- coding: utf-8 -*-
"""
Create Time: 2020/09/26 12:07 AM
Author: ada
"""

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

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

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

	def addRear(self,item):
		self.items.insert(0,item)

	def removeFront(self):
		self.items.pop()

	def removeRear(self):
		self.items.pop(0)

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

'''双向队列，python的append，右边其实是前端，从栈的角度来理解，它确实是，后进先出，就是在头部（前端），而左边是后端。'''