leetcode 79. 单词搜索

笨比master

于 2021-04-04 16:20:49 发布

阅读量122

点赞数

分类专栏： new leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/m0_37454852/article/details/115429966

版权

new leetcode 专栏收录该内容

84 篇文章

订阅专栏

79. 单词搜索

在这里插入图片描述

class Solution {
public:
    int Y, X;
    bool exist(vector<vector<char>>& board, string& word, int ind, int yy, int xx) {
        if(ind == word.size()) return true;
        if(yy < 0 || yy >= Y || xx < 0 || xx >= X) return false;
        if(board[yy][xx] != word[ind]) return false;
        char ch = board[yy][xx];
        board[yy][xx] = '#';
        bool flag = exist(board, word, ind+1, yy-1, xx);
        flag = flag || exist(board, word, ind+1, yy+1, xx);
        flag = flag || exist(board, word, ind+1, yy, xx-1);
        flag = flag || exist(board, word, ind+1, yy, xx+1);
        board[yy][xx] = ch;
        return flag;
    }
    bool exist(vector<vector<char>>& board, string word) {
        Y = board.size();
        X = board[0].size();
        for(int yy = 0; yy < Y; yy++) {
            for(int xx = 0; xx < X; xx++) {
                if(exist(board, word, 0, yy, xx)) return true;
            }
        }
        return false;
    }
};