开心一下

大早上做了一道题,题目与之前的类似,就当温习了,有趣的事情来了

2021/11/15

class Solution {
public:
    bool exist(vector<vector<char>>& board, string word) {
        int row = board.size(),col = board[0].size();
        for(int i = 0 ; i < row ; ++i){
            for(int j = 0 ; j < col ; ++j){
                if(dfs(board,word,&i,&j,0,&row,&col))return true;
            }
        }
        return false;
    }
    bool dfs(vector<vector<char>>& board, string word,int* x,int* y,int key,int* row,int* col){
        if(board[*x][*y] != word[key])return false;
        if(key == word.size()-1)return true;
        char visited = board[*x][*y];
        board[*x][*y] = '*';
        vector<pair<int,int>> location ={{0,1},{0,-1},{1,0},{-1,0}};
        for(auto& loc : location){
            int dx = *x + loc.first,dy = *y + loc.second;
            if(dx < 0 || dx >= *row || dy < 0 || dy >= *col || board[dx][dy] == '*')continue;
            if(dfs(board,word,&dx,&dy,key+1,&*row,&*col)) return true;  
            //if(dfs(board,word,&dx,&dy,key+1,row,col)) return true;  
        }
        board[*x][*y] = visited;
        return false;
    }
};

看这一行代码

//if(dfs(board,word,&dx,&dy,key+1,&*row,&*col)) return true;  
if(dfs(board,word,&dx,&dy,key+1,row,col)) return true;  

当我为 &*row,&*col这代码觉得不错的时候,突然意识到我真是傻逼!

我的开心谁能懂,😂


    


公众号'艾恩凝'
个人公众号
个人微信
个人微信
    吾心信其可行,
          则移山填海之难,
                  终有成功之日!
                                  ——孙文
    评论
    0 评论
avatar

取消