c语言简单走迷宫（太复杂不会啊）

Question

写了两天了，还是不懂，没报错，但是结果要不就是死循环要不就是多走几步

Answer 1

#include<stdio.h>
int road[101][101];   //  记录道路信息
bool pass[101][101],flag = false;  //  pass没走过为false, flag 判断是否有结果
int len,high; // 迷宫 长,高,道路结果储存
char key[10001];
void Find_road(int high1,int len1,int num);
int main(){

    scanf("%d %d",&len,&high);
    for(int z=1;z<=high;z++) for(int z1=1;z1<=len;z1++) scanf("%d",&road[z][z1]);
    Find_road(1,1,0);
    if(!flag) printf("No way!");
    return 0;
}

void Find_road(int high1,int len1,int num){
    if(high1==high && len1==len){
        flag = true;
        for(int z=0;z<num;z++) printf("%c",key[z]);
    }

    if(flag || pass[high1][len1] || road[high1][len1] ) return;

    pass[high1][len1] = true;
    //  向上走
    if(high1>1 && high1<=high){
        key[num] = 'U';
        Find_road(high1-1,len1,num+1);
    }
    //  向下走
    if(high1<high && high1>=1){
        key[num] = 'D';
        Find_road(high1+1,len1,num+1);
    }
    //  向左
    if(len1>1 && high1<=high){
        key[num] = 'L';
        Find_road(high1,len1-1,num+1);
    }
    //  向右边
    if(len1<len && len1>=1){
        key[num] = 'R';
        Find_road(high1,len1+1,num+1);
    }

    pass[high1][len1] = false;
}

满意答案的可以给个打赏与采纳哦～
不然人人白嫖就没人解答了T _ T