堆栈
__author__ = "Hao Rui Chun"
class Stack(object):
def __init__(self):
self._lis = []
def push(self,item):
"""入栈"""
self._lis.append(item)
def pop(self):
"""出栈"""
self._lis.pop()
def peek(self):
"""获取栈顶元素"""
if self._lis:
return self._lis[-1]
else:
return
def isEmpty(self):
return self._lis == None
def size(self):
return len(self._lis)
if __name__ == '__main__':
stack = Stack()
stack.push(1)
stack.push(2)
stack.push(3)
stack.push(4)
print(stack.isEmpty())
print(stack.peek())
队列
__author__ = "Hao Rui Chun"
class Queue(object):
def __init__(self):
self._lis = []
def enqueue(self,item):
"""入队"""
self._lis.append(item)
def dequeue(self,item):
"""出队"""
self._lis.pop(0)
def isEmpty(self):
return self._lis == None
def size(self):
return len(self._lis)
if __name__ == '__main__':
queue = Queue()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(3)
queue.enqueue(4)
print(queue.size())
双端队列
__author__ = "Hao Rui Chun"
class Double_Queue(object):
"""双端队列"""
def __init__(self):
self.items = []
def is_empty(self):
"""判断队列是否为空"""
return self.items == []
def add_front(self, item):
"""在队头添加元素"""
self.items.insert(0, item)
def add_rear(self, item):
"""在队尾添加元素"""
self.items.append(item)
def remove_front(self):
"""从队头删除元素"""
return self.items.pop(0)
def remove_rear(self):
"""从队尾删除元素"""
return self.items.pop()
def size(self):
"""返回队列大小"""
return len(self.items)
if __name__ == "__main__":
deque = Double_Queue()
deque.add_front(1)
deque.add_front(2)
deque.add_rear(3)
deque.add_rear(4)
print(deque.size())
print(deque.remove_front())
print(deque.remove_front())
print(deque.remove_rear())
print(deque.remove_rear())