Word Search

最新推荐文章于 2019-01-03 22:26:53 发布

小鱼人会飞

最新推荐文章于 2019-01-03 22:26:53 发布

阅读量840

点赞数

分类专栏： LeetCode 文章标签： leetcode DFS 算法

本文链接：https://blog.csdn.net/ybhou/article/details/9474241

版权

LeetCode 专栏收录该内容

112 篇文章 0 订阅

订阅专栏

题目

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.

思路

递归

注意：要用一个 vector<vector<bool>> visited 数组来记录是否访问过，因为 ["aa"], "aaa" output:true ,expecetd:false

class Solution {
public:
    bool exist(vector<vector<char> > &board, string word) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        bool flag = false;
        for(int i=0;i<board.size();i++) {
            for(int j=0;j<board[0].size();j++) {
                if(board[i][j]==word[0]) {
                    vector<vector<bool>> visited(board.size(), vector<bool>(board[0].size(),false));
                    flag = flag||myIsExit(visited, board, i, j, word, 0);
                    if(flag==true)
                        return true;
                }                
            }          
        }
        return flag;
    }
    
    bool myIsExit(vector<vector<bool>> &visited, vector<vector<char> > &board, int x, int y, string &word, int cur) {
        bool flag = false;
        if(x<0 || x>=board.size() || y<0 || y>=board[0].size())
            return false;
        if(board[x][y]!=word[cur])
            return false;
        if(board[x][y]==word[cur] && visited[x][y]==false) {
            if(cur==word.size()-1)
                return true;
            else {
                visited[x][y] = true;
                flag = flag || myIsExit(visited,board,x,y+1,word,cur+1);
                flag = flag || myIsExit(visited,board,x+1,y,word,cur+1);
                flag = flag || myIsExit(visited,board,x,y-1,word,cur+1);
                flag = flag || myIsExit(visited,board,x-1,y,word,cur+1);
            }
        }
        return flag;
    }
    
};

Run Status: Accepted!
Program Runtime: 500 milli secs