797979

79

class Solution {
    boolean res = false;
    char[] resString = new char[15];
    boolean[][] visit;
    public boolean exist(char[][] board, String word) {
        char[] w = word.toCharArray();
        int len = w.length;
        int x = board.length;
        int y = board[0].length;
        visit = new boolean[x][y];
        for(int i = 0; !res && i < x; i++){
            for(int j = 0; !res && j < y; j++){
                if(board[i][j] == w[0]){
                    dfs(board, w, 0, len, i, j, x, y);
                }
            }
        }
        return res;
    }

    public void dfs(char[][] board, char[] w, int currentStep, int len, int currentX, int currentY, int x, int y){
        if(currentStep == len){
            res = true;
        } 
        
        if(res || currentX >= x || currentY >= y || currentX < 0 || currentY < 0 || board[currentX][currentY] != w[currentStep] || visit[currentX][currentY]){
            return;
        }
        visit[currentX][currentY] = true;
        dfs(board, w, currentStep + 1, len, currentX + 1, currentY, x, y);
        dfs(board, w, currentStep + 1, len, currentX, currentY + 1, x, y);
        dfs(board, w, currentStep + 1, len, currentX - 1, currentY, x, y);
        dfs(board, w, currentStep + 1, len, currentX, currentY - 1, x, y);
        visit[currentX][currentY] = false;
    }
}