LeetCode 79. 单词搜索

 

 

public static boolean exist(char[][] board, String word) {
        if(board.length < 1 || board[0].length < 1 )return false;
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[i].length; j++) {
                if(dfs(board,word,i,j,0)){
                    return true;
                }
            }
        }
        return false;
    }

//k记录匹配到第几个字符
//+26的目的表示已经遍历过，避免和别的字母重复
    private static boolean dfs(char[][] board, String word, int i, int j,int k) {
        if(k >= word.length())return true;
        if(i < 0 || i > board.length-1 || j < 0 || j > board[i].length-1 || board[i][j] != word.charAt(k))return false;
        board[i][j]+=26;
        boolean result = dfs(board,word,i+1,j,k+1) || dfs(board,word,i,j+1,k+1) || dfs(board,word,i-1,j,k+1) || dfs(board,word,i,j-1,k+1);
        board[i][j]-=26;
        return result;
    }