[Leetcode] 79. Word Search

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

Solution:
DFS

class Solution {
    public boolean exist(char[][] board, String word) {
        if(board == null) {
            return false;
        }
        
        int depth = board.length;
        int width = board[0].length;
        for(int d = 0; d < depth; d++) {
            for(int w = 0; w < width; w++) {
                if(search(word, board, 0, d, w)) {
                    return true;
                }
            }
        }
        return false;
    }
    
    // 枚举每一种可能性，如果字符a存在于board中，则继续搜索a邻接的四个字符
    public boolean search(String word, char[][] board, int p, int d, int w) {
        int depth = board.length;
        int width = board[0].length;
        
        // 前四条处理字符坐标超出board边界的情况
        //最后一条表示当所有边界都满足时，board中不存在该字符
        if(d<0 || d==depth || w<0 || w==width || word.charAt(p) != board[d][w]) {
            return false;
        }
        
        // 由上一个if得到在p位置的字符存在于board中，若p已经到达字符串末尾则返回true
        if(p == word.length()-1) {
            return true;
        }
        
        // 为了防止search回溯的小技巧：
        // 将该位置的字符用char存储后设置为0，这样无论如何匹配都不可能相符
        // 需要注意的是search结束后要将字符还原回去，进行下一轮search
        char cur = board[d][w];
        board[d][w] = 0;
        
        // 检查字符的上下左右是否存在
        boolean found = search(word, board, p+1, d+1, w) || search(word, board, p+1, d-1, w)
            || search(word, board, p+1, d, w+1) || search(word, board, p+1, d, w-1);
        board[d][w] = cur;
        
        return found;
    }
}

Reference: https://www.youtube.com/watch?v=oUeGFKZvoo4