原题:
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 =
[ ['A','B','C','E'], ['S','F','C','S'], ['A','D','E','E'] ]word =
"ABCCED"
, -> returns
true
,
word =
"SEE"
, -> returns
true
,
word = "ABCB"
, -> returns false
.
代码如下:
bool exist(char** board, int boardRowSize, int boardColSize, char* word) {
int n,m;
int flag=1;
printf("%d,%d",boardRowSize,boardColSize);
bool A(char** board,int ver,int hor,char* word,int flag,int boardRowSize, int boardColSize);
for(n=0;n<boardRowSize;n++)
{
for(m=0;m<boardColSize;m++)
{
if(*(*(board+n)+m)==*word)
{
char temp=*(*(board+n)+m);
*(*(board+n)+m)='1';
if(A(board,n-1,m,word,flag,boardRowSize,boardColSize)||A(board,n+1,m,word,flag,boardRowSize, boardColSize)||A(board,n,m+1,word,flag,boardRowSize,boardColSize)||A(board,n,m-1,word,flag,boardRowSize,boardColSize))
return true;
*(*(board+n)+m)=temp;
}
}
}
return false;
}
bool A(char** board,int ver,int hor,char* word,int flag,int boardRowSize, int boardColSize)
{
if(*(word+flag)=='\0')
return true;
if(ver<0||ver>=boardRowSize||hor<0||hor>=boardColSize)
return false;
if(*(word+flag)==*(*(board+ver)+hor))
{
char temp=*(*(board+ver)+hor);
*(*(board+ver)+hor)='1';
flag++;
if(A(board,ver-1,hor,word,flag,boardRowSize,boardColSize)||A(board,ver+1,hor,word,flag,boardRowSize,boardColSize)||A(board,ver,hor+1,word,flag,boardRowSize,boardColSize)||A(board,ver,hor-1,word,flag,boardRowSize,boardColSize))
return true;
else
*(*(board+ver)+hor)=temp;
}
return false;
}
关键点在于路径的恢复和标记,这个可以避免环的出现。
这个是此题亮点。