core dumped 跪求解答Lf函数为什么有bug

Question

 #include <iostream>
#include <cstdio>
#include <queue>
#include <stack>
#include <cstring>
using namespace std;

int lx[]= {0,0,-1,0,1}; /// left up right down
int ly[]= {0,-1,0,1,0};

int rx[]= {0,0,-1,0,1}; /// right up left down
int ry[]= {0,1,0,-1,0};

bool ma[44][44]; ///map 1 is came
char s[44][44];
int ans=1,ex,ey;
int  n,m;

struct node
{
    int x,y,step;
};

bool flag1(int x,int y)
{
    if (x>=1&&x<=m&&y>=1&&y<=n&&s[x][y]=='.'||s[x][y]=='E')
    {
        return 1;
    }
    return 0;
}

int Lf(int xx,int yy,int step,int dire)
{
    int i;
    if (xx==ex&&yy==ey)
    {
        ans=step;
        return 0;
    }
    if (dire == 1)
    {
        if (flag1(xx+lx[4],yy+ly[4]))       Lf(xx+lx[4],yy+ly[4],step+1,4);

        for (i=1; i<=3; i++)
        {
            if (flag1(xx+lx[i],yy+ly[i]))       Lf(xx+lx[i],yy+ly[i],step+1,i);
        }
    }
    else if (dire == 2)
    {
        for (i=1; i<=4; i++)
        {
            if (flag1(xx+lx[i],yy+ly[i])) Lf(xx+lx[i],yy+ly[i],step+1,i);
        }
    }
    else if (dire == 3)
    {
        if (flag1(xx+lx[2],yy+ly[2]))       Lf(xx+lx[2],yy+ly[2],step+1,2);

        if (flag1(xx+lx[3],yy+ly[3]))       Lf(xx+lx[3],yy+ly[3],step+1,3);

        if (flag1(xx+lx[4],yy+ly[4]))       Lf(xx+lx[4],yy+ly[4],step+1,4);

        if (flag1(xx+lx[1],yy+ly[1]))       Lf(xx+lx[1],yy+ly[1],step+1,1);
    }
    else if (dire == 4)
    {
        if (flag1(xx+lx[3],yy+ly[3]))       Lf(xx+lx[3],yy+ly[3],step+1,3);

        if (flag1(xx+lx[4],yy+ly[4]))       Lf(xx+lx[4],yy+ly[4],step+1,4);

        if (flag1(xx+lx[1],yy+ly[1]))       Lf(xx+lx[1],yy+ly[1],step+1,1);

        if (flag1(xx+lx[2],yy+ly[2]))       Lf(xx+lx[2],yy+ly[2],step+1,2);
    }
}


int main()
{
    int t;
    int i,j;
    int sx,sy;
    char c;
    scanf("%d",&t);
    while (t--)
    {
        memset(ma,0,sizeof(ma));
        scanf("%d%d",&n,&m);
        for(i=1; i<=m; i++)
        {
            for (j=1; j<=n; j++)
            {
                cin>>s[i][j];
                if (s[i][j] == 'S')
                {
                    sx=i;
                    sy=j;
                }
                else if (s[i][j]=='E')
                {
                    ex=i;
                    ey=j;
                }
            }
        }
        Lf(sx,sy,1,2);
        cout<<ans<<endl;
    }
    return 0;
}

Answer 1

http://blog.csdn.net/lily854212198/article/details/8077595