LeetCode: Word Search

最新推荐文章于 2021-10-20 23:02:10 发布

Tingmei

最新推荐文章于 2021-10-20 23:02:10 发布

阅读量4.4k

点赞数

分类专栏：算法 C++ 文章标签： search string vector function class

本文链接：https://blog.csdn.net/Tingmei/article/details/8040246

版权

算法同时被 2 个专栏收录

109 篇文章 0 订阅

订阅专栏

C++

108 篇文章 0 订阅

订阅专栏

Problem:

Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

For example,
Given board =

[
  ["ABCE"],
  ["SFCS"],
  ["ADEE"]
]

word = "ABCCED" , -> returns true ,
word = "SEE" , -> returns true ,

word = "ABCB", -> returns false.

递归搜索

class Solution {
public:
    bool find(vector< vector<char> > &board, int i, int j, string &word, int idx)
    {
        if (idx == word.size()) return true;
        if (i < board.size() && j < board[i].size()
        && i >= 0 && j >= 0 && board[i][j] == word[idx])
        {
            board[i][j] = '#';
            ++idx;
            return find(board, i+1, j, word, idx)
            | find(board, i-1, j, word, idx)
            | find(board, i, j-1, word, idx)
            | find(board, i, j+1, word, idx);
        }
        return false;
    }
    bool exist(vector<vector<char> > &board, string word) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        for (int i = 0; i < board.size(); ++i)
        {
            for (int j = 0; j < board[i].size(); ++j)
            {
                if (board[i][j] == word[0])
                {
                    vector<vector<char> > tmp (board);
                    bool result = find(tmp, i, j, word, 0);
                    if (result == true)
                        return true;
                }
            }
        }
    }
};