wordSearch

#include<iostream>
#include<vector>
#include<string>
using namespace std;
bool dfs(vector<vector<char>>&board,string&word,int index,int x,int y,vector<vector<bool>>&visited)
{
if(index==word.size())
return true;
if(x<0||y<0||x>=board.size()||y>=board[0].size())
return false;
if(visited[x][y])
return false;
if(board[x][y]!=word[index])
return false;
visited[x][y]=true;
bool ret=dfs(board,word,index+1,x-1,y,visited)||dfs(board,word,index+1,x+1,y,visited)||dfs(board,word,index+1,x,y-1,visited)||dfs(board,word,index+1,x,y+1,visited);
visited[x][y]=false;
return ret;
}
bool exist(vector<vector<char>>&board,string word)
{
const int m=board.size();
const int n=board[0].size();
vector<vector<bool>>visited(m,vector<bool>(n,false));
for(int i=0;i<m;++i)
for(int j=0;j<n;++j)
if(dfs(board,word,0,i,j,visited))
return true;
return false;
}
int main()
{
vector<vector<char>>board;
char a[]={'A','B','C','E'};
char a1[]={'S','F','C','S'};
char a2[]={'A','D','E','E'};
vector<char>m(a,a+sizeof(a)/sizeof(char));
vector<char>m1(a1,a1+sizeof(a1)/sizeof(char));
vector<char>m2(a2,a2+sizeof(a2)/sizeof(char));
board.push_back(m);
board.push_back(m1);
board.push_back(m2);
string word("ABCB");
cout<<exist(board,word)<<endl;
}