up_stairs的博客

#迷宫问题---栈和队列 #继承ValueError class StackUnderflow(ValueError): pass #定义一个栈 class SStack(): def __init__(self): self._elems = [] def is_empty(self): return self._elems == []

#队列 class QueueUnderflow(ValueError): pass class SQueue(): def __init__(self,init_len=8): self._len = init_len self._elems = [0]*init_len self._head = 0 self._

#迷宫问题---栈和队列 #定义maze line_0 = [1,1,1,1,1,1,1] line_1 = [1,1,0,1,1,1,1] line_2 = [1,1,0,1,1,1,1] line_3 = [1,1,0,0,0,1,1] line_4 = [1,1,0,1,0,0,1] line_5 = [1,1,0,1,1,1,1] line_6 = [1,1,1,1,1,1,1] maz