用Python实现简单的栈
class Stack():
def __init__(self, size = 5):
self.size = size;
self.stack = [];
self.top = 0;
def is_full(self):
return self.top == self.size;
def is_empty(self):
return self.top == 0;
def push(self, x):
if self.top < self.size:
self.stack.append(x);
self.top += 1;
def pop(self):
if self.top > 0:
self.top -= 1;
return self.stack.pop();
def __repr__(self):
return str(self.stack);
用Python实现简单的队列
class Queue():
def __init__(self, size = 5):
self.size = size;
self.length = 0;
self.queue = [];
def is_full(self):
return self.length == self.size;
def is_empty(self):
return self.length == 0;
def en_queue(self, x):
if self.length < self.size:
self.queue.append(x);
self.length += 1;
def de_queue(self):
if self.length > 0:
p = self.queue[0];
del(self.queue[0]);
self.length -= 1;
return p;
def __repr__(self):
return str(self.queue);