79. Word Search

 

79. Word Search

Medium

2421130FavoriteShare

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.

Example:

board =
[
  ['A','B','C','E'],
  ['S','F','C','S'],
  ['A','D','E','E']
]

Given word = "ABCCED", return true.
Given word = "SEE", return true.
Given word = "ABCB", return false.

Accepted

353,472

Submissions

1,074,965

class Solution {
public:
    bool exist(vector<vector<char>>& board, string word) {
    	int row=board.size();
    	int col=board[0].size();
        //bool visited[row][col]={false};
        vector<vector<bool>> visited(row,vector<bool>(col,false));
        bool tp;
        for(int i=0;i<row;i++){
        	for(int j=0;j<col;j++){
        		if(dfs(board,word,0,visited,i,j)) return true;
        	}
        }
        return false;
    }
    bool dfs(vector<vector<char>>& board,string word,int temp,vector<vector<bool>>& visited,int x,int y){
    	if(temp==word.size()) return true;
    	if(x<0||y<0||x>=board.size()||y>=board[0].size()){
    		return false;
    	}
        if(visited[x][y]==true) return false;
    	if(board[x][y]!=word[temp]) return false;
    	visited[x][y]=true;
    	bool tmp=dfs(board,word,temp+1,visited,x-1,y)||dfs(board,word,temp+1,visited,x,y-1)||dfs(board,word,temp+1,visited,x+1,y)||dfs(board,word,temp+1,visited,x,y+1);
    	visited[x][y]=false;
    	return tmp;
    }
};