Leetcode刷题笔记(c++)

class Solution {
public:
    int row=0;
    int col=0;
    int len=0;
    bool dfs(vector>& board,vector>& finded,string &word,int k,int i,int j){
        // cout<-1&&finded[i-1][j]==0&&board[i-1][j]==word[k+1]){
            finded[i-1][j]=1;
            if(dfs(board,finded,word,k+1,i-1,j))return 1;
            finded[i-1][j]=0;
        }
        if(i+1
            finded[i+1][j]=1;
            if(dfs(board,finded,word,k+1,i+1,j))return 1;
            finded[i+1][j]=0;
        }
        if((j-1>-1)&&(finded[i][j-1]==0)&&(board[i][j-1]==word[k+1])){
            finded[i][j-1]=1;
            if(dfs(board,finded,word,k+1,i,j-1))return 1;
            finded[i][j-1]=0;
        }
        if(j+1
            finded[i][j+1]=1;
            if(dfs(board,finded,word,k+1,i,j+1))return 1;
            finded[i][j+1]=0;
        }
        return 0;
    }
    bool exist(vector>& board, string word) {
        row=board.size();
        col=board[0].size();
        len=word.size();
        for(int i=0;i
            for(int j=0;j
                if(board[i][j]==word[0]){
                    vector>finded(row,vector(col,0));
                    finded[i][j]=1;
                    // cout<