LeetCode 79. Word Search-CSDN博客

本文介绍了一种用于在二维字符网格中查找特定单词的深度优先搜索算法。通过递归回溯，算法检查每个网格位置是否匹配单词的首字母，并继续沿着四个方向搜索后续字母。为避免重复访问，使用了访问标记矩阵。

这道题要注意在结束的时候恢复状态。

class Solution {
    public boolean exist(char[][] board, String word) {
        // Corner Case
        if(board == null || board.length == 0 || board[0] == null || board[0].length == 0){
            return false;
        }
        int rows = board.length, cols = board[0].length;
        boolean[][] visited = new boolean[rows][cols]; 
        for(int i = 0; i < rows; i++){
            for(int j = 0; j < cols; j++){
                if(backtrack(board, word, i, j, 0, visited)){
                    return true;
                }
            }
        }
        return false;
    }
    private boolean backtrack(char[][] board, String word, int i, int j, int idx, boolean[][] visited){
        int rows = board.length, cols = board[0].length;
        // Base case
        if(idx == word.length()){
            return true;
        }
        if(i < 0 || i >= rows || j < 0 || j >= cols || visited[i][j] == true){
            return false;
        }
        if(board[i][j] != word.charAt(idx)){
            return false;
        }
        visited[i][j] = true;
        boolean res = backtrack(board, word, i - 1, j, idx + 1, visited)
            || backtrack(board, word, i + 1, j, idx + 1, visited)
            || backtrack(board, word, i, j - 1, idx + 1, visited)
            || backtrack(board, word, i, j + 1, idx + 1, visited);
        if(res){
            return true;
        }
        visited[i][j] = false;
        return false;
    }
}