leetcode——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.

分析：

深度优先搜索

class Solution {
private:
    //从x，y处开始搜索word的第s个字母，chosed用来保存已选中的位置
    bool searchFrom(vector<vector<char>>& board, int x, int y, const string& word, int s, vector<vector<bool>>& chosed)
    {
        if (board[x][y] != word[s])
        {
            return false;
        }
        if (s == word.length() - 1) //查找到word的最后一个字符
        {
            return true;
        }
        int m = board.size(), n = board[0].size();
        //在邻域中查找下一个字母
        chosed[x][y] = true;
        if (x > 0 && !chosed[x - 1][y]) 
        {
            if (searchFrom(board, x - 1, y, word, s + 1, chosed))
            {
                return true;
            }
        }
        if (x < m - 1 && !chosed[x + 1][y]) 
        {
            if (searchFrom(board, x + 1, y, word, s + 1, chosed))
            {
                return true;
            }
        }
        if (y > 0 && !chosed[x][y - 1]) 
        {
            if (searchFrom(board, x, y - 1, word, s + 1, chosed))
            {
                return true;
            }
        }
        if (y < n - 1 && !chosed[x][y + 1]) 
        {
            if (searchFrom(board, x, y + 1, word, s + 1, chosed))
            {
                return true;
            }
        }
        chosed[x][y] = false;
        return false;
    }
public:
    bool exist(vector<vector<char>>& board, string word) {
        if (board.empty() || board[0].empty() || word.empty()) 
        {
            return false;
        }
        int m = board.size(), n = board[0].size();
        vector<vector<bool>> chosed(m, vector<bool>(n, false));
        for (int i = 0; i < m; ++i) 
        {
            for (int j = 0; j < n; ++j) 
            {
                if (searchFrom(board, i, j, word, 0, chosed))
                {
                    return true;
                }
            }
        }
        return false;
        
    }
};