矩阵中的路径

题目描述

请设计一个函数，用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径。路径可以从矩阵中的任意一个格子开始，每一步可以在矩阵中向左，向右，向上，向下移动一个格子。如果一条路径经过了矩阵中的某一个格子，则该路径不能再进入该格子。 例如 a b c e s f c s a d e e 矩阵中包含一条字符串"bcced"的路径，但是矩阵中不包含"abcb"路径，因为字符串的第一个字符b占据了矩阵中的第一行第二个格子之后，路径不能再次进入该格子。

题目思路

回溯法，递归求解

题目代码

C++:

class Solution {
public:
    bool hasPath(char* matrix, int rows, int cols, char* str)
    {
     if(matrix == nullptr || rows < 1 || cols < 1 || str == nullptr)
            return false;
      bool *visited = new bool[rows * cols];
      memset(visited, 0 , rows * cols);
      int pathLength = 0;
        for(int row = 0; row < rows; ++row){
            for(int col = 0; col < cols; ++col){
                if(hasPathCore(matrix, rows, cols, row, col, str, pathLength, visited)){
                    return true;
                }
            }
        }
        delete[] visited;
        return false;
    }
    bool hasPathCore(const char* matrix, int rows, int cols,int row, int col, char* str, int& pathLength, bool* visited){
        if(str[pathLength] == '\0')
            return true;
        bool hasPath = false;
        if(row >= 0 && row <rows && col >= 0 && col < cols && matrix[row * cols + col] == str[pathLength] && !visited[row * cols + col]){
            ++pathLength;
            visited[row * cols + col] = true;
            hasPath = hasPathCore(matrix, rows, cols, row, col - 1, str, pathLength, visited) || hasPathCore(matrix, rows, cols, row - 1, col, str, pathLength, visited) || hasPathCore(matrix, rows, cols, row, col + 1, str, pathLength, visited) || hasPathCore(matrix, rows, cols, row + 1, col, str, pathLength, visited);
            if(!hasPath){
             --pathLength;
             visited[row * cols + col] = false;
            }
        }
        return hasPath;
    }


};

java:

public class Solution {
    public boolean hasPath(char[] matrix, int rows, int cols, char[] str)
    {
       if(matrix.length == 0 || rows < 1 || cols < 1 || str.length == 0)
           return false;
        boolean[] visited = new boolean[matrix.length];
        int pathLength = 0;
        for(int row = 0; row < rows; row++){
            for(int col = 0; col < cols; col++){
                if(hasPathCore(matrix, rows, cols, row, col, pathLength, str, visited))
                    return true;
            }
        }
        return false;
    }
    public boolean hasPathCore(char[] matrix, int rows, int cols, int row, int col, int pathLength, char[] str, boolean[] visited){
        boolean hasPath = false;
	        if(row >= 0 && row < rows && col >= 0 && col < cols && matrix[row * cols + col] == str[pathLength] && (!visited[row * cols + col])){
	            ++pathLength;
	            visited[row * cols + col] = true;
	            if(pathLength ==str.length) { return true ; }
	            hasPath = hasPathCore(matrix, rows, cols, row - 1, col, pathLength, str, visited) || hasPathCore(matrix, rows, cols, row, col - 1, pathLength, str, visited) || hasPathCore(matrix, rows, cols, row + 1, col, pathLength, str, visited) || hasPathCore(matrix, rows, cols, row, col + 1,  pathLength,str, visited);
	            if(!hasPath){
	                --pathLength;
	                visited[row * cols + col] = false;
	            }
	        }
	        return hasPath;
    }

}