力扣79（单词搜索）dfs回溯算法 (2)java

class Solution{

private char[] words;
private String word;
private int n,m;
private char[][] board;
private int[][] direction ={{0,-1},{1,0},{0,1},{-1,0}};

public boolean exist(char[][] board, String word) {
    this.word = word;
    words = word.toCharArray();
    this.board = board;
    n = board.length;
    m = board[0].length;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            //从[i,j]这个坐标开始查找
            if (dfs(i, j, 0))
                return true;
        }
    }
    return false;
}

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

    //递归之后再把当前的坐标复原
    board[i][j] = tmp;
    return res;
}

}