Leetcode 79. 单词搜索

思路：回溯，注意复原现场。

class Solution {
    public boolean exist(char[][] board, String word) {
        char[] words = word.toCharArray();
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[0].length; j++) {
                //从[i,j]这个坐标开始查找
                if (dfs(board, words, i, j, 0))
                    return true;
            }
        }
        return false;
    }
    boolean dfs(char[][] board, char[] word, int i, int j, int index) {
        //边界的判断，如果越界直接返回false。index表示的是查找到字符串word的第几个字符，
        //如果这个字符不等于board[i][j]，说明验证这个坐标路径是走不通的，直接返回false
        if (i >= board.length || i < 0 || j >= board[0].length || j < 0 || board[i][j] != word[index])
            return false;
        //如果word的每个字符都查找完了，直接返回true
        if (index == word.length - 1)
            return true;
        //把当前坐标的值保存下来，为了在最后复原
        char tmp = board[i][j];
        //然后修改当前坐标的值
        board[i][j] = '.';
        //走递归，沿着当前坐标的上下左右4个方向查找
        boolean res = dfs(board, word, i + 1, j, index + 1) || dfs(board, word, i - 1, j, index + 1) ||
                dfs(board, word, i, j + 1, index + 1) || dfs(board, word, i, j - 1, index + 1);
        //递归之后再把当前的坐标复原
        board[i][j] = tmp;
        return res;
    }
}

关键代码另一种写法： 如果找到了该单词，注意提前跳出循环

class Solution {
    public boolean exist(char[][] board, String word) {
        int m = board.length;
        int n = board[0].length;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (dfs(board, word, i, j, 0)){
                    return true;
                }
            }
        }
        return false;
    }

    boolean dfs(char[][] board, String word, int i, int j,int index){
        if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != word.charAt(index)){
            return false;
        }
        if (index == word.length() - 1){
            return true;
        }
        char tmp = board[i][j];
        board[i][j] = '.';
        int[] di = {0,0,1,-1};
        int[] dj = {1,-1,0,0};
        boolean res = false;
        for (int k = 0; k < 4; k++) {
            int next_i = i + di[k], next_j = j + dj[k];
            res = dfs(board, word, next_i, next_j, index + 1);
            if (res){
            	// 找到了该单词，注意提前跳出循环
                break;
            }
        }
        board[i][j] = tmp;
        return res;
    }
}

开辟一个visited数组来记录，注意回溯思想：寻找完该位置后，将该位置重新标记为未访问，DFS多了一个判断条件 visited[i][j]==true

class Solution {
    public boolean exist(char[][] board, String word) {
        int m = board.length;
        int n = board[0].length;
        boolean[][] visited = new boolean[m][n];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (dfs(board, word, i, j, 0, visited)){
                    return true;
                }
            }
        }
        return false;
    }
    // 多了一个判断条件  visited[i][j]==true
    boolean dfs(char[][] board, String word, int i, int j,int index, boolean[][] visited){
        if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != word.charAt(index) || visited[i][j]){
            return false;
        }
        if (index == word.length() - 1){
            return true;
        }
        visited[i][j] = true;
        int[] di = {0,0,1,-1};
        int[] dj = {1,-1,0,0};
        boolean res = false;
        for (int k = 0; k < 4; k++) {
            int next_i = i + di[k], next_j = j + dj[k];
            res = dfs(board, word, next_i, next_j, index + 1, visited);
            if (res){
                break;
            }
        }
        // 寻找完该位置后，将该位置重新标记为未访问
        visited[i][j] = false;
        return res;
    }
}

牛客：矩阵中的路径，把二维矩阵换成了一维矩阵。

public class Solution {
    public boolean hasPath(char[] matrix, int rows, int cols, char[] str) {
        boolean[][] isVisited = new boolean[cols][rows];
        for (int i = 0; i < cols; i++) {
            for (int j = 0; j < rows; j++) {
                if (judge(matrix, i, j, rows, cols, isVisited, str, 0)) {
                    return true;
                }
            }
        }
        return false;
    }
    private boolean judge(char[] matrix, int i, int j, int rows, int cols, boolean[][] isVisited, char[] str, int k) {
        if (i < 0 || j < 0 || i >= cols || j >= rows ||
                matrix[j * cols + i] != str[k] || isVisited[i][j]) {
            return false;
        }
        if (k == str.length - 1) return true;
        isVisited[i][j] = true;
        if (judge(matrix, i - 1, j, rows, cols, isVisited, str, k + 1) ||
            judge(matrix, i + 1, j, rows, cols, isVisited, str, k + 1) ||
            judge(matrix, i, j - 1, rows, cols, isVisited, str, k + 1) ||
            judge(matrix, i, j + 1, rows, cols, isVisited, str, k + 1))
            return true;
        isVisited[i][j] = false;
        return false;
    }
}