lintcode 123. 单词搜索 dfs

给出一个二维的字母板和一个单词，寻找字母板网格中是否存在这个单词。
单词可以由按顺序的相邻单元的字母组成，其中相邻单元指的是水平或者垂直方向相邻。每个单元中的字母最多只能使用一次。

样例
样例 1:

输入：["ABCE","SFCS","ADEE"]，"ABCCED"
输出：true
解释：
[    
     A B C E
     S F C S 
     A D E E
]
(0,0)A->(0,1)B->(0,2)C->(1,2)C->(2,2)E->(2,1)D
样例 2:

输入：["z"]，"z"
输出：true
解释：
[ z ]
(0,0)z

class Solution {
public:
    /**
     * @param board: A list of lists of character
     * @param word: A string
     * @return: A boolean
     */
    bool exist(vector<vector<char>> &board, string &word) {
        // write your code here
        if(board.size()==0) return false;
        bool judge=false;
        for (int i = 0; i < board.size(); i++) {
            /* code */
            for (int j = 0; j < board[i].size(); j++) {
                /* code */
                if(board[i][j]==word[0])judge=dfs(board,word,i,j,0);
                if(judge) return judge;
            }
        }
       return judge;
    }

    bool dfs(vector<vector<char>> &board, string &word,int i,int j,int index)
    {
        if(i>=0&&i<board.size()&&j>=0&&j<board[0].size())
        {
            if(word.size()-1==index&&board[i][j]==word[index])return true;
            else if(board[i][j]==word[index])
            {
                char temp=board[i][j];
                board[i][j]='0';
                bool result=dfs(board,word,i-1,j,index+1)
                        || dfs(board,word,i+1,j,index+1)
                        ||dfs(board,word,i,j+1,index+1)
                        ||dfs(board,word,i,j-1,index+1);
                board[i][j]=temp;
                return result;
            }
        }
    } 
    /*  void dfs(vector<vector<char>> &board, string &word,int i,int j,bool &judge,int index)
    {//超时写法
        if(i>=0&&i<board.size()&&j>=0&&j<board[0].size())
        {
            if(word.size()-1==index&&board[i][j]==word[index]) judge=true;
            else if(board[i][j]==word[index])
            {
                char temp=board[i][j];
                board[i][j]='0';
                dfs(board,word,i-1,j,judge,index+1);
                dfs(board,word,i+1,j,judge,index+1);
                dfs(board,word,i,j+1,judge,index+1);
                dfs(board,word,i,j-1,judge,index+1);
                board[i][j]=temp;
            }
        }
    }*/
};