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

// "static void main" must be defined in a public class.
class Solution {
    
    private char [][] board;
    private String word;
    private int [][] direction;
    private int n,m;
    private boolean [][] marked;

    public boolean exist(char[][] board, String word) {
        this.board = board;
        this.word = word;
        direction = new int[][]{{-1,0},{0,1},{1,0},{0,-1}};//偏移向量
        n = board.length;
        if(n==0) return false;
        m = board[0].length;
        marked = new boolean[n][m];

        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                if(dfs(i,j,0))
                    return true;
            }
        }
        return false;
    }

    private boolean dfs(int x,int y,int cout){
        if(cout == word.length()-1)//判断最后一个点是否正确，是递归的出口
            return board[x][y] == word.charAt(cout);
        if (board[x][y] == word.charAt(cout)) {//如果相等则往下走
            for(int k=0;k<4;k++){//在四个方向上朝从没有走过的点走。
                marked[x][y] = true;//true为走过的点，没走过的点为默认值false
                int newx = x + direction[k][0];
                int newy = y + direction[k][1];
                if(inArea(newx,newy)&&marked[newx][newy]==false&&dfs(newx,newy,cout+1))
                    return true;
            }
            marked[x][y] = false;
        }
        return false;
    }

    private Boolean inArea(int x,int y){
        return (x>=0&&x<n&&y>=0&&y<m);
    }
    
}