79. 单词搜索

具体思路参考：https://blog.csdn.net/qq_43606119/article/details/135540457

class Solution {
    int[][] bias = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
    // boolean[][] visited;
    boolean ans = false;
    public boolean exist(char[][] board, String word) {
        int m = board.length, n = board[0].length;
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                dfs(0, i, j, board, word);
            }
        }
        return ans;
    }
    private void dfs(int index, int i, int j, char[][] board, String word) {
        if (board[i][j] != word.charAt(index)) return;
        if (index == word.length() - 1) ans = true;
        char ch = board[i][j];
        board[i][j] = '#'; // 已访问
        for (int[] b : bias) {
            int ni = i + b[0], nj = j + b[1];
            if (ni >= 0 && ni < board.length && nj >= 0 && nj < board[0].length && index + 1 < word.length()) {
                dfs(index + 1, ni, nj, board, word);
            }
        }
        board[i][j] = ch; // 回溯
    }
}