python栈实战 迷宫寻找出口

import json from stack_1 import stack class find_road: def __init__(self): self.map=None #读取存档里的地图 self.read_map() #记录当前位置 self.pos_x=0 self.pos_y=0 #定义走过的路 self.road=stack() def read_map(self): with open('map.json','r',encoding='utf-8') as f: self.map=json.loads(f.read()) def get_exit(self): while self.pos_x!=18 and self.pos_y!=18: #判断右边能走就往右走 if self.map[self.pos_x+1][self.pos_y]==' ': #同时填上之前走的路防止重复走 self.map[self.pos_x][self.pos_y]='#' self.pos_x+=1 #将走过的路保存到栈里面 self.road.push((self.pos_x,self.pos_y)) elif self.map[self.pos_x][self.pos_y+1]==' ': self.map[self.pos_x][self.pos_y]='#' self.pos_y+=1 self.road.push((self.pos_x,self.pos_y)) elif self.map[self.pos_x-1][self.pos_y]==' ': self.map[self.pos_x][self.pos_y]='#' self.pos_x-=1 self.road.push((self.pos_x,self.pos_y)) elif self.map[self.pos_x][self.pos_y-1]==' ': self.map[self.pos_x][self.pos_y]='#' self.pos_y-=1 self.road.push((self.pos_x,self.pos_y)) else: #发现那条路也走不了就说明上一步走的错误需要退回上一步重新走 pos=self.road.pop().pos #同时标记这条路防止下一次再走 self.map[self.pos_x][self.pos_y]='#' self.pos_x=pos[0] self.pos_y=pos[1] print('找到出口') self.road.print_all() if __name__=='__main__': a=find_road() a.get_exit()