79. Word Search

problem：

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 .

这是一道深度搜索的问题。用vector<vector<bool> >visited 记录以访问过的letter。当处于board[i][j]时你可以向四个方向进行尝试访问，必须满足在边界之内，且没有访问过，等于word中的下一个letter。类似于迷宫，递归回溯。需要一个辅助数组记录走过的位置，防止同一个位置被使用多次。

class Solution {
public:
    bool exist(vector<vector<char> >& board, string word) {
        row = board.size();
        col = board[0].size();
        vector<vector<bool> > visited(row, vector<bool>(col, false));
        for(int i=0; i<row; ++i)
        {
            for(int j=0; j<col; j++)
            {
                if(dfs(board, word, 0, visited, i, j))
                {
                    return true;
                }
            }
        }
        return false;
    }
private:
    int row;
    int col;
    bool dfs(vector<vector<char> >& board, string word, int index, vector<vector<bool> >& visited, int x, int y)
    {
        if(index == word.length())
            return true;
        if(x<0 || y<0 || x>=row || y>=col)
            return false;
        if(visited[x][y])
            return false;
        if(board[x][y] != word[index])
            return false;

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

};