剑指 Offer 12. 矩阵中的路径

class Solution {
    boolean[][] visited;

    char[][] board;

    int[][] dist = {{1,0},{-1,0},{0,1},{0,-1}};

    public boolean exist(char[][] board, String word) {
        visited = new boolean[board.length][board[0].length];
        this.board = board;

        for (int row = 0; row < board.length; row++) {
            for (int col = 0; col < board[row].length; col++) {
                if (board[row][col] == word.charAt(0) && searchWord(word,0, row, col)){
                    return true;
                }
            }
        }
        return false;
    }

    boolean searchWord(String word, int idx, int row,int col){
        if (idx == word.length()-1 && word.charAt(idx) == board[row][col]){
            return true;
        }
        if (word.charAt(idx) != board[row][col]){
            return false;
        }
        visited[row][col] = true;

        for (int[] ints : dist) {

            int x = row + ints[0];
            int y = col + ints[1];
            if ( x<0 || y<0 || x >= board.length || y >= board[0].length || visited[x][y] ){
                continue;
            }

            if (searchWord(word,idx+1,x,y)){
                return true;
            }
        }
        visited[row][col] = false;
        return false;
    }
}