剑指 Offer 12. 矩阵中的路径

剑指 Offer 12. 矩阵中的路径

难度中等

给定一个 m x n 二维字符网格 board 和一个字符串单词 word 。如果 word 存在于网格中，返回 true ；否则，返回 false 。

单词必须按照字母顺序，通过相邻的单元格内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。

例如，在下面的 3×4 的矩阵中包含单词 "ABCCED"（单词中的字母已标出）。

示例 1：

输入：board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"

输出：true

示例 2：

输入：board = [["a","b"],["c","d"]], word = "abcd"

输出：false

提示：

• 1 <= board.length <= 200

• 1 <= board[i].length <= 200

• board 和 word 仅由大小写英文字母组成

注意：本题与主站 79 题相同：https://leetcode-cn.com/problems/word-search/

class Solution {

     public boolean exist(char[][] board, String word) {

            for (int i = 0; i < board.length; i++) {

                for (int j = 0; j < board[i].length; j++) {

                    if (board[i][j] == word.charAt(0)) {

                        // System.out.print(i + "," + j + "=" + word.charAt(0));

                        if (dfs(board, i, j, word,1)) {

                            return true;

                        }

                        // System.out.println("");

                    }

                }

            }

            return false;

        }

        private boolean dfs(char[][] board, int i, int j, String word, int index) {

            if (index == word.length()) {

                return true;

            }

            board[i][j] = '*';

            // System.out.print("," + word.charAt(index));

            boolean result = false;

            if (i > 0) {

                if (board[i - 1][j] == word.charAt(index)) {

                    result = result || dfs(board, i - 1, j, word, index + 1);

                }

            }

            if (j > 0) {

                if (board[i][j - 1] == word.charAt(index)) {

                    result = result || dfs(board, i, j - 1, word, index + 1);

                }

            }

            if (i < board.length - 1) {

                if (board[i + 1][j] == word.charAt(index)) {

                    result = result || dfs(board, i + 1, j, word, index + 1);

                }

            }

            if (j < board[i].length - 1) {

                if (board[i][j + 1] == word.charAt(index)) {

                    result = result || dfs(board, i, j + 1, word, index + 1);

                }

            }

            board[i][j] = word.charAt(index - 1);

            return result;

        }

}