Posted on | Edited on

LeetCode

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
class Solution {
    static boolean[][] visited;
    public boolean exist(char[][] board, String word) {
        visited=new boolean[board.length][board[0].length];
        for(int i=0;i<board.length;i++){
            for(int j=0;j<board[i].length;j++){
                if(search(board,word,i,j,0)) return true;
            }
        }
        return false;
    }
    private boolean search(char[][] board, String word, int i, int j, int index){
        if(index==word.length()) return true;
        
        if(i>=board.length || i<0 ||j>=board[i].length || j<0 ||board[i][j]!=word.charAt(index) ||visited[i][j]){
            return false;
        } 
        
        visited[i][j]=true;
        if(search(board,word,i-1,j,index+1) ||
           search(board,word,i+1,j,index+1) ||
           search(board,word,i,j-1,index+1) ||
           search(board,word,i,j+1,index+1)){
            return true;
        } 
        
        visited[i][j]=false;
        return false;
    }
}

0%