79. 单词搜索

题目：

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

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

示例 1：

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

思路：

1. 深度有限搜索，回溯算法，遍历可行路线；遍历完单词结束

2. 为了保证路线不走重复，使用路径记录集合来记录已走路线，可用相同矩阵记录行走路线，撤回原路则标志位重新置为0   ---> 注意此时判断是否已走尽量采用O(1)的判断方法，减少确认时间

代码：

 public static boolean exist(char[][] board, String word) {
        if (word == null || word.isEmpty()) {
            return true;
        }
        int m = board.length;
        int n = board[0].length;
        char[] w = word.toCharArray();
        char[][] alreadyPoint = new char[m][n];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (board[i][j] == w[0]) {
                    String v = ((i) + "," + (j));
                    alreadyPoint[i][j] = 1;
                    boolean re1 = existIf(board, w, 1, alreadyPoint,i,j, m, n);
                    if (re1) {
                        return re1;
                    }
                    alreadyPoint[i][j] = 0;

                }
            }
        }
        return false;
    }

    public static boolean existIf(char[][] board, char[] w, int point, char[][] alreadyPoint, Integer i, Integer j, int m, int n) {
        if (point == w.length) {
            return true;
        }


        if (i + 1 != m) {
            if (board[i + 1][j] == w[point]) {
                int nexti = i + 1;
                int nextj = j;
                if (alreadyPoint[nexti][nextj] != 1) {
                    alreadyPoint[nexti][nextj] = 1;
                    boolean re1 = existIf(board, w, point + 1, alreadyPoint, nexti, nextj, m, n);
                    if (re1) {
                        return re1;
                    }
                    alreadyPoint[nexti][nextj] = 0;
                }
            }
        }
        if (i != 0) {
            if (board[i - 1][j] == w[point]) {
                int nexti = i - 1;
                int nextj = j;
                if (alreadyPoint[nexti][nextj] != 1) {
                    alreadyPoint[nexti][nextj] = 1;
                    boolean re1 = existIf(board, w, point + 1, alreadyPoint, nexti, nextj, m, n);
                    if (re1) {
                        return re1;
                    }
                    alreadyPoint[nexti][nextj] = 0;
                }
            }
        }
        if (j + 1 != n) {
            if (board[i][j + 1] == w[point]) {
                int nexti = i;
                int nextj = j + 1;
                if (alreadyPoint[nexti][nextj] != 1) {
                    alreadyPoint[nexti][nextj] = 1;
                    boolean re1 = existIf(board, w, point + 1, alreadyPoint, nexti, nextj, m, n);
                    if (re1) {
                        return re1;
                    }
                    alreadyPoint[nexti][nextj] = 0;
                }
            }
        }
        if (j != 0) {
            if (board[i][j - 1] == w[point]) {
                int nexti = i;
                int nextj = j - 1;
                if (alreadyPoint[nexti][nextj] != 1) {
                    alreadyPoint[nexti][nextj] = 1;
                    boolean re1 = existIf(board, w, point + 1, alreadyPoint, nexti, nextj, m, n);
                    if (re1) {
                        return re1;
                    }
                    alreadyPoint[nexti][nextj] = 0;
                }
            }
        }
        return false;
    }