擅长:python、mysql、java
<p>队列是先进先出的,这很容易做到。你知道吗</p>
<pre><code>class Stack:
def __init__(self):
self.items = []
def is_empty(self):
return self.items == []
def push(self, item):
return self.items.append(item)
def pop(self):
return self.items.pop()
def get_elements(self):
return self.items
class Queue:
def __init__(self):
self.items = []
def is_empty(self):
return self.items == []
def push(self, item):
return self.items.append(item)
def pull(self):
return self.items.pop(0)
def get_elements(self):
return self.items
stack = Stack() # items = []
stack.push("A") # items = ["A"]
stack.push("B") # items = ["A", "B"]
stack.push("C") # items = ["A", "B", "C"]
stack.pop() # items = ["A", "B"]
queue = Queue() # items = []
queue.push("A") # items = ["A"]
queue.push("B") # items = ["A", "B"]
queue.push("C") # items = ["A", "B", "C"]
queue.pull() #items = ["B", "C"]
</code></pre>