一笔画小游戏,好玩的很
就是到了后面比较麻烦,手动找路径太慢了,作为程序员,这又是一个锻炼的好机会是不是!于是乎,了解了一下dfs和bfs算法(都是路径搜索算法),然后就开撸:
#pointArr=[[1,0,0,3],#[0,2,2,0],#[0,1,0,0],#[0,0,0,3]]
pointArr=[[0,0,0,0,0,0],
[-1,0,0,0,0,1],
[0,0,0,0,0,0],
[0,0,0,0,0,0],
[-1,-1,0,0,-1,0],
[0,0,0,0,-1,0],
[0,0,0,0,0,0],
]classsolutiondfs():def __init__(self,arr):
self.arr=arr
self.rows=len(arr)
self.cols=len(arr[0])
self.nowPositionRow=None
self.nowPositionCol=None
self.steps=[]#寻找开始的点
defstartPoint(self):for i inrange(len(self.arr)):for j inrange(len(self.arr[i])):if self.arr[i][j]==1:returni,j#判断是否结束