LeetCode Top 100 Liked Questions 79. Word Search (Java版; Medium)

welcome to my blog

LeetCode Top 100 Liked Questions 79. Word Search (Java版; Medium)

题目描述

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

The word can be constructed from letters of 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.

第一次做, 回溯法, 改变现场, 恢复现场; (相同的题: 剑指offer12题–矩阵中的路径)

/*
可以从任意一个位置开始搜索
回溯法
*/
class Solution {
    public boolean exist(char[][] board, String word) {
        if(board==null || board.length==0 || board[0].length==0 || word==null || word.length()==0)
            return false;
        int rows = board.length, cols = board[0].length;
        boolean[][] flag = new boolean[rows][cols];
        boolean res = false;
        for(int i=0; i<rows; i++){
            for(int j=0; j<cols; j++){
                res = Core(board, i, j, word, 0, flag);
                if(res)
                    return true;
            }
        }
        return false;
    }
    public boolean Core(char[][] board, int i, int j, String word, int index, boolean[][] flag){
        //base case
        if(index == word.length())
            return true;
        //索引越界
        if(i<0 || i>=board.length || j<0 || j>=board[0].length)
            return false;
        //该位置使用过, 返回false
        if(flag[i][j]==true)
            return false;
        //该位置没使用过, 但是与word中的当前字符不匹配
        if(board[i][j] != word.charAt(index))
            return false;
        //该位置没使用过, 同时与word中的当前字符匹配
        flag[i][j] = true;
        boolean res = Core(board, i-1, j, word, index+1, flag) ||
                      Core(board, i+1, j, word, index+1, flag) ||
                      Core(board, i, j-1, word, index+1, flag) ||
                      Core(board, i, j+1, word, index+1, flag);
        //恢复现场
        flag[i][j] = false;
        return res;
    }
}