79. 单词搜索

 

---

class Solution {
    //以board[i][j]开始，是否找到从word[count]开始的字符串
    bool help(vector>& board,string &word,int i,int j,int count)
    {
        if(board[i][j]!=word[count])return false;
        //此处，注意，左值要为变量不可word.size()-1==count
        if(count==word.size()-1)return true;
        char tmp=board[i][j];
        board[i][j]='0';//原地代替，一个word和二维网络中不会出现的字符
        if(
            (i-1>=0&&help(board,word,i-1,j,count+1))||
            (i+1=0&&help(board,word,i,j-1,count+1))||
            (j+1>& board, string word) {

        
        for(int i=0;i