（day06 dfs+剪枝）剑指 Offer 12. 矩阵中的路径

题目

链接：https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof/

题解

典型的矩阵矩阵搜索问题
参考题解：https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof/solution/mian-shi-ti-12-ju-zhen-zhong-de-lu-jing-shen-du-yo/

class _12TJ2{

    public boolean exist(char[][] board, String word){

        // 转化为字符数组便于判断
        char[] chars = word.toCharArray();
        // 获取行数
        int n = board.length;
        // 获取列数
        int m = board[0].length;
        // 从每个节点开始穷举
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                //  只要存在路径上的字符串起来与目标字符串相等，就返回
                if (dfs(board,chars,n,m,i,j,0))
                {
                    return true;
                }
            }
        }
        // 遍历完还是没有匹配到，返回false
        return false;
    }

    public boolean dfs(char[][] board, char[] chars,int n,int m,int i,int j,int k){
        // 边界条件加是否与当前字符匹配，不匹配直接返回false
        if (i>=n || i<0 || j>=m || j<0 || board[i][j] != chars[k]) {
            return false;
        }
        // 当k达到字符串的最后一个字符也匹配时说明匹配成功
        if (k == chars.length-1){
            return true;
        }
        
        // 将访问过的字符节点
        board[i][j] = '\0';

        boolean res = dfs(board,chars,n,m,i+1,j,k+1) || dfs(board,chars,n,m,i-1,j,k+1) ||
                dfs(board,chars,n,m,i,j+1,k+1) || dfs(board,chars,n,m,i,j-1,k+1);
        // 回溯
        board[i][j] = chars[k];

        return res;

    }

}