请设计一个函数，用来判断在一个矩阵中是否存在一条包含某字符串所有字符的路径。路径可以从矩阵中的任意一个格子开始，每一步可以在矩阵中向左，向右，向上，向下移动一个格子。如果一条路径经过了矩阵中的某一个格...

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

 

转载于:https://www.cnblogs.com/q-1993/p/10986701.html