[Leetcode] 79. Word Search 解题报告

题目：

Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

For example,
Given board =

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

word  =  "ABCCED" , -> returns  true ,
word  =  "SEE" , -> returns  true ,
word  =  "ABCB" , -> returns  false .

思路：

这是二维数组中一道典型的DFS+回溯的题目。为了保证每个字符都被匹配过一次，我们需要定义一个同样大小的二维数组，表示对应的字符是否已经被访问过。其余好像没有什么需要特别注意的了。

代码：

class Solution {
public:
    bool exist(vector<vector<char>>& board, string word) {
        if (board.size() == 0 || board[0].size() == 0)
            return false;
        int m = board.size(), n = board[0].size();  
        vector<vector<bool>> hash(m, vector<bool>(n, false));  
        for(int i = 0; i < m; i++)  
            for(int j = 0; j < n; j++)  
                if(dfs(board, hash, word, i, j, 0)) 
                    return true;  
        return false;  
    }
private:
    bool dfs(vector<vector<char>> &board, vector<vector<bool>> &hash, string &word, int y, int x, int k) {
        if (k >= word.size())
            return true;
        int m = board.size(), n = board[0].size();
        if (y < 0 || y >= m || x < 0 || x >= n || hash[y][x] || board[y][x] != word[k])
            return false;
        hash[y][x] = true;
        if (dfs(board, hash, word, y + 1, x, k + 1))
            return true;
        if (dfs(board, hash, word, y - 1, x, k + 1))
            return true;
        if (dfs(board, hash, word, y, x + 1, k + 1))
            return true;
        if (dfs(board, hash, word, y, x - 1, k + 1))
            return true;
        hash[y][x] = false;
        return false;
    }
};