79. 单词搜索

class Solution {
    int m, n;
    char[] arr;
    boolean[][] visited;
    char[][] mat;

    private boolean dfs(int x, int y, int index) {
        if (x < 0 || y < 0 || x >= m || y >= n) {
            return false;
        }
        if (visited[x][y]) {
            return false;
        }
        if (mat[x][y] != arr[index]) {
            return false;
        }
        if (index == arr.length - 1) {
            return true;
        }
        visited[x][y] = true;

        boolean f1 = dfs(x + 1, y, index + 1);
        if (f1) {
            return true;
        }
        f1 = dfs(x - 1, y, index + 1);
        if (f1) {
            return true;
        }
        f1 = dfs(x, y + 1, index + 1);
        if (f1) {
            return true;
        }
        f1 = dfs(x, y - 1, index + 1);
        if (f1) {
            return true;
        }
        visited[x][y] = false;
        return false;
    }

    public boolean exist(char[][] board, String word) {
        m = board.length;
        n = board[0].length;
        arr = word.toCharArray();
        mat = board;
        if (m * n < arr.length) {
            return false;
        }
        visited = new boolean[m][n];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (dfs(i, j, 0)) {
                    return true;
                }
            }
        }
        return false;
    }
}