wordSearch
来源:互联网 发布:中科大软件学院学费 编辑:程序博客网 时间:2024/05/01 19:51
#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;
}
#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;
}
0 0
- WordSearch
- wordSearch
- leetcode wordsearch II
- leetcode之wordsearch
- 将语句中的单词扣出来,并排序的wordSearch类
- Javapns-sdk16-2.2.1多线程推送
- php中对文件、目录的移动
- 使用MyBatis对表执行增删改查操作——基于注解的实现
- Swift中获取字符串子串
- MFC读取配置文件GetPrivateProfileString
- wordSearch
- 驱动调试中怎么样让windbg停在DriverEntry
- 线程同步 信号量 Semaphore 内核对象 CreateSemaphore
- kind与type
- maven之ssh项目搭建
- PreparedStatement的setString导致越界问题解决方案
- service intent must be explicit:intent问题的解决
- 在iOS中实现一个简单的画板App
- ubuntu关闭开启触控板