这是 Boggle 求解器的一部分。我做了一个递归方法来遍历一个字符串矩阵。MyLetteres
已存储所有字符(例如 a、b、c...),MyLetteres1
初始化为空,并且tracker
为false
. 这些变量标记了我已经访问过的矩阵中的哪些坐标(我无法重新访问坐标)。我只能移动到相邻的坐标(不能跳过)。该参数String word
使用单个字母(起点)进行初始化。int x
并且int y
是我的 (x,y) 坐标。忽略int p
和int n
。
我遇到的问题是我似乎无法正确标记该方法已经结束的坐标,然后我似乎无法将tracker
(最后一行)重置false
为下一个getPaths()
运行。
这是我的代码,请帮忙!
public void getPaths(int p, int n,int x, int y,String word, boolean tracker[][],boolean MyLetteres1[][],String MyLetteres[][],boolean checker)throws IOException{
if(word.length()>1)
checker=Check(word);//Check() just checks to see if its a word.
tracker[x][y]=true;//makes sure that the checkers never goes back over starting letter
if(x+1<MyLetteres.length&&tracker[x+1][y]==false){//up{
//checker=Check(word);//checks to see if its word
//reverse(word);
System.out.print("1 ("+x+","+y+"), ");//for debugging purposes
getPaths(n,p,x+1, y,word+MyLetteres[x+1][y], tracker,MyLetteres1,MyLetteres,true);//recursive part
}
if(x-1>0&&tracker[x-1][y]==false){//down
//checker=Check(word);
//reverse(word);
System.out.print("2 ("+x+","+y+"), ");
getPaths(n,p,x-1, y ,word+MyLetteres[x-1][y], tracker,MyLetteres1,MyLetteres,true);
}
if(y+1<MyLetteres.length&&tracker[x][y+1]==false){//right
//checker=Check(word);
//reverse(word);
System.out.print("3 ("+x+","+y+"), ");
getPaths(n, p,x , y+1,word+MyLetteres[x][y+1], tracker,MyLetteres1,MyLetteres,true);
}
if(y-1>0&&tracker[x][y-1]==false){//left
//checker=Check(word);
//reverse(word);
System.out.print("4 ("+x+","+y+"), ");
getPaths(n,p,x , y-1,word+MyLetteres[x][y-1], tracker,MyLetteres1,MyLetteres,true);
}
if(x+1<MyLetteres.length&&y+1<MyLetteres.length&&tracker[x+1][y+1]==false){//right, up
//checker=Check(word);
//reverse(word);
System.out.print("5 ("+x+","+y+"), ");
getPaths(n,p,x+1, y+1,word+MyLetteres[x+1][y+1], tracker,MyLetteres1,MyLetteres,true);
}
if(x-1>0&&y-1>0&&tracker[x-1][y-1]==false){//down, left
//checker=Check(word);
//reverse(word);
System.out.print("6 ("+x+","+y+"), ");
getPaths(n,p,x-1, y-1,word+MyLetteres[x-1][y-1], tracker,MyLetteres1,MyLetteres,true);
}
if(x-1>0&&y+1<MyLetteres.length&&tracker[x-1][y+1]==false){//down, right
//checker=Check(word);
//reverse(word);
System.out.print("7 ("+x+","+y+"), ");
getPaths(n,p,x+1, y-1, word+MyLetteres[x-1][y+1],tracker,MyLetteres1,MyLetteres,true);
}
if(x+1<MyLetteres.length&&y-1>0&&tracker[x+1][y-1]==false){//up, left
//checker=Check(word);
//reverse(word);
System.out.print("8 ("+x+","+y+"), ");
getPaths(n, p,x-1 , y+1, word+MyLetteres[x+1][y-1],tracker,MyLetteres1,MyLetteres,true);
}
tracker=deepCopyBoolean(MyLetteres1);//MyLetteres1 never changes so this is my attempt at resetting tracker (which does change) back to all false so that when the program starts a new path, nothing has been "visited".
}