解题思路:
利用递归的思想可以解决问题,总体来说,就是超左右前后四个方向的深度优先搜索的问题。
具体代码如下:
# -*- coding:utf-8 -*-
class Solution:
def hasPath(self, matrix, rows, cols, path):
# write code here
#1.左右前后方向中存在下一个字符,则可以考虑将该字符位置作为第二个位置的指针
#2.访问过的位置不能进行二次访问
#3.如果找到了最后的位置的指针则返回True
data = []
start = []
for r in range(rows):
data.append(matrix[r*cols:(r+1)*cols])
for c in range(cols):
data[-1][c] == path[0]
start.append([r, c])
res_set = []
for ptr in start:
visited = []
res_set.append(self.dfs(data, path, ptr, visited))
for res in res_set:
if res:
return True
return False
def dfs(self, data, path, ptr, visited):
if len(path) == 0:
return True
next_node = []
if ptr[0] == 0:
next_node.append([ptr[0]+1, ptr[1]])
elif ptr[0] == len(data) - 1:
next_node.append([ptr[0]-1, ptr[1]])
else:
next_node.append([ptr[0]-1, ptr[1]])
next_node.append([ptr[0]+1, ptr[1]])
if ptr[1] == 0:
next_node.append([ptr[0], ptr[1]+1])
elif ptr[1] == len(data[0]) - 1:
next_node.append([ptr[0], ptr[1]-1])
else:
next_node.append([ptr[0], ptr[1]-1])
next_node.append([ptr[0], ptr[1]+1])
if ptr not in visited and data[ptr[0]][ptr[1]] == path[0]:
visited.append(ptr)
res_set = []
for next_ptr in next_node:
res_set.append(self.dfs(data, path[1:], next_ptr, visited))
for res in res_set:
if res:
return True
return False