你帮帮我吧
by yanglich @ 2023-10-05 16:11:53
就是,帮帮我们吧!!!!!!!!!!!!!!!!!!!!!!!!!!
by zhangruoshuiIMZ @ 2023-10-05 16:16:20
@[zhangruoshuiIMZ](/user/878283)
你不是开了数组吗?没必要用单个的写法,还浪费空间
by ATION001 @ 2024-01-31 17:49:29
@[zhangruoshuiIMZ](/user/878283)
就是你输入字符的那里,在函数里判断,最好还是打注释,不然改着改着思路就乱了
by ATION001 @ 2024-01-31 17:53:14
@[zhangruoshuiIMZ](/user/878283)
打上注释别人更好帮你改,不然别人看不出来也很正常
by ATION001 @ 2024-01-31 17:55:18
@[zhangruoshuiIMZ](/user/878283)
然后要剪枝,如果不剪枝会有太多重复搜索,所以必须剪枝
by ATION001 @ 2024-01-31 18:10:36
@[zhangruoshuiIMZ](/user/878283)
不过大致框架是对的
by ATION001 @ 2024-01-31 18:12:36
@[zhangruoshuiIMZ](/user/878283)
void dfs(int x,int y,int co){
if(flag[co][x][y]){
return;
}
flag[co][x][y]=1;
if(co==l+1){
b[x][y]='*';
return;
}
if(s[co]=="NORTH"){
x=x-1;
}else if(s[co]=="SOUTH"){
x=x+1;
}else if(s[co]=="WEST"){
y=y-1;
}else{
y=y+1;
}
if(x>=1&&y>=1&&x<=n&&y<=m&&a[x][y]!='X'){
dfs(x,y,co);
dfs(x,y,co+1);
}
}
by ATION001 @ 2024-02-03 11:52:54