数据结构

maze = [                 # 迷宫
    [1,1,1,1,1,1,1,1,1,1],
    [1,0,0,1,0,0,0,1,0,1],
    [1,0,0,1,0,0,0,1,0,1],
    [1,0,0,0,0,1,1,0,0,1],
    [1,0,1,1,1,0,0,0,0,1],
    [1,0,0,0,1,0,0,0,0,1],
    [1,0,1,0,0,0,1,0,0,1],
    [1,0,1,1,1,0,1,1,0,1],
    [1,1,0,0,0,0,0,0,0,1],
    [1,1,1,1,1,1,1,1,1,1],
    ]

dirs = [ # 方向
        lambda x,y:(x + 1,y), # 右
        lambda x,y:(x - 1,y), # 左
        lambda x,y:(x,y - 1), # 上
        lambda x,y:(x,y + 1), # 下
       ]

def mpath(x1,y1,x2,y2):
    stack = []
    stack.append((x1,y1)) # 起点
    while len(stack) > 0:  # 栈的长度 > 0
        curNode = stack[-1] # 当前节点就是栈顶元素
        if curNode[0] == x2 and curNode[1] == y2: #如果当前位置就是终点了，就结束了
            # 到达终点了
            for p in stack:
                print(p)
            return True
        for dir in dirs:
            nextNode = dir(curNode[0],curNode[1]) # 找下一个
            if maze[nextNode[0]][nextNode[1]] == 0:  # maze 找到 0 可以走
              # 找到了下一个位置
                stack.append(nextNode) # 不管以后能不能走 也要把这步加入到栈中
                maze[nextNode[0]][nextNode[1]] = -1  # 标记为已经走过，防止死循环
                break
        else: # 四个方向 都没有到找
            maze[curNode[0]][curNode[1]] = -1  # 死路一条 ，下次别走了
            stack.pop()  # 回溯
    print("没有路！")
    return False

mpath(1,1,8,8)

from collections import deque

queue = deque()
queue.append(1) # 进队
queue.append(2) # 进队
print(queue) # 打印此时的队列
print(queue.popleft()) # 打印出队 的 数
print(queue) # 打印剩下的队列

class Node(object):
    def __init__(self,item):
        self.item = item
        self.next = None

a = Node(10)
b = Node(20)
c = Node(30)

a.next = b
b.next = c

print(a.next.item)
print(a.next.next.item)

class Node(object):
    def __init__(self,item):
        self.item = item
        self.next = None

head = Node(10)
head.next = Node(20)
head.next.next = Node(30)

def traversal(head):
    curNode = head # 临时用指针
    while curNode is not None:
        print(curNode.item)
        curNode = curNode.next # 指向下一个curNode

traversal(head)