# -*- coding:utf-8 -*-
class Solution:def hasPath(self, matrix, rows, cols, path):# write code hereif not matrix or not path:return Falseindex_arr = [i for i in range(len(matrix)) if matrix[i]==path[0]]for i in index_arr:if self.findPath(matrix,rows,cols,path,i,[]):return Truereturn Falsedef findPath(self, matrix, rows, cols, path, index, visited):if index in visited:return Falseif index < 0 or index >= len(matrix):return Falseif not path:return Falseif matrix[index] != path[0]:return False# 如果前面的情况都不存在，当前元素与path中第一个元素相等，此时# 如果path的长度等于1if len(path) == 1:return Truevisited.append(index)# 第一个元素下标0只能向右向下if index == 0:return self.findPath(matrix,rows,cols,path[1:],index+1,visited) or self.findPath(matrix, rows, cols,path[1:],index+cols,visited)# 最后一个元素if index == len(matrix) - 1:return self.findPath(matrix, rows, cols, path[1:], index - 1, visited) or self.findPath(matrix, rows, cols,path[1:],index-cols,visited)# 元素在第一列if index % cols == 0:return self.findPath(matrix, rows, cols, path[1:], index + 1, visited) or self.findPath(matrix, rows, cols,path[1:],index-cols,visited) or self.findPath(matrix, rows, cols, path[1:], index + cols, visited)# 元素在最后一列if (index + 1) % cols == 0:return self.findPath(matrix, rows, cols, path[1:], index - 1, visited) or self.findPath(matrix, rows, cols, path[1:], index - cols, visited) or self.findPath(matrix, rows, cols, path[1:], index + cols, visited)else:return self.findPath(matrix, rows, cols, path[1:], index + 1, visited) or self.findPath(matrix, rows, cols,path[1:], index - 1, visited) or self.findPath(matrix, rows, cols, path[1:], index - cols, visited) or self.findPath(matrix, rows, cols, path[1:],index + cols, visited)