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.

因为要求word中相邻的字符在board中也是相邻的，所以用回溯法比较合适。主函数中需要找到每次回溯的入口点。即word中的第一个字符。在回溯过程中，只要下标越界或字符不匹配就返回false，否则，将该位置的字符置为数字字符‘0’，然后在上下左右四个方向递归寻找，当匹配到word最后一个字符时，就返回true。

class Solution {
public:
    bool exist(vector<vector<char>>& board, string word) {
        int row=board.size();
        int col=board[0].size();

        for(int i=0;i<board.size();i++)
            for(int j=0;j<board[0].size();j++)
                if(board[i][j]==word[0])
                    if(find(board,i,j,word,0))
                        return true;
        return false;
    }
    bool find(vector<vector<char>>& board,int r, int c, string word, int index){
        if(r>=0 && r<board.size() && c>=0 && c<board[0].size() && board[r][c]==word[index]){}
        else
            return false;
        if(index==word.size()-1)
            return true;
        char tmp=board[r][c];
        board[r][c]='0';
        if(find(board,r+1,c,word,index+1)) return true;
        if(find(board,r-1,c,word,index+1)) return true;
        if(find(board,r,c+1,word,index+1)) return true;
        if(find(board,r,c-1,word,index+1)) return true;
        board[r][c]=tmp;
        return false;
    }
};