LeetCode 刷题之路 Word Search

Word Search

Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of the sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

Example:

board =
[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

Given word = "ABCCED", return true.
Given word = "SEE", return true.
Given word = "ABCB", return false.

这题是个典型的利用DFS深度优先搜索的应用。需要注意的是每次走过某个点的时候需要以某种方法标注记录那个点被visit过了，要不然就容易被多次visit产生错误结果。

class Solution {
    public boolean exist(char[][] board, String word) {
        if(board.length == 0 || (board.length*board[0].length< word.length())){
            return false;
        }

        for(int i = 0; i < board.length; i++){
            for(int j = 0; j < board[0].length; j++){
                if(board[i][j] != word.charAt(0)){
                    continue;
                }
                else{
                    if(search(board, word, i, j, 0) == true){
                        return true;
                    }
                }
            }
        }
        return false;
    }

    public boolean search(char[][] board, String word, int i, int j, int start){
        if(start == word.length()){
            return true;
        }

        if(i<0 || i== board.length
                || j<0 || j==board[0].length
                || word.charAt(start) != board[i][j]){
            return false;
        }

        char cur = board[i][j];
        board[i][j] = '!';

        boolean result = search(board, word, i+1, j, start+1)
                ||search(board, word, i, j+1, start+1)
                ||search(board, word, i-1, j, start+1)
                ||search(board, word, i, j-1, start+1);

        board[i][j]=cur;

        return result;
    }
}