leetcode 79.单词搜索 Java

题目链接

https://leetcode-cn.com/problems/word-search/

描述

	给定一个二维网格和一个单词，找出该单词是否存在于网格中。

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

示例

示例1

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

给定 word = "ABCCED", 返回 true
给定 word = "SEE", 返回 true
给定 word = "ABCB", 返回 false

数据限制

board 和 word 中只包含大写和小写英文字母。
1 <= board.length <= 200
1 <= board[i].length <= 200
1 <= word.length <= 10^3

代码

class Solution {

    private boolean[][] used;
    private int[] xArr = {0, 0, 1, -1};
    private int[] yArr = {1, -1, 0, 0};

    public boolean exist(char[][] board, String word) {
        used = new boolean[board.length][board[0].length];


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

        return false;
    }   

    public boolean dfs(char[][] board, String word, int x, int y, int index) {
        if (board[x][y] != word.charAt(index)) {
            return false;
        }

        if (index == word.length() - 1) {
            return true;
        }

        used[x][y] = true;
        for (int i = 0; i < 4; i++) {
            int newX = x + xArr[i];
            int newY = y + yArr[i];

            if (newX >= 0 && newX < board.length && newY >= 0 && newY < board[0].length && !used[newX][newY]){
                
                if (dfs(board, word, newX, newY, index + 1)) {
                    return true;
                }
               
            }
        }

        used[x][y] = false;
        return false;
    }
}