剑指面试题12.矩阵中的路径(java)：深度优先遍历

题目

具体代码

class Solution {
    public boolean exist(char[][] board, String word) {
        char[] ch = word.toCharArray();
        for(int i = 0;i < board.length;i++){
            for(int j = 0;j < board[0].length;j++){
                if(dfs(board,i,j,ch,0))
                    return true;
            }
        }
        return false;
    }
    public boolean dfs(char[][] board,int i,int j, char[] ch,int k){
        if(i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != ch[k]){
            return false;
        }
        if(k == ch.length - 1){
            return true;
        }
        char temp = board[i][j];
        board[i][j] = '/';
        boolean res = dfs(board,i-1,j,ch,k+1)||dfs(board,i+1,j,ch,k+1)||dfs(board,i,j-1,ch,k+1)||dfs(board,i,j+1,ch,k+1);
        board[i][j] = temp;
        return res;
    }
}

参考leetcode题解