发一个笔试题

#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <iostream>
#define MAX_SIZE 8

using namespace std;

struct dir
{
    int x, y;
    int d;
};

int H[4] = {0, 1, 0, -1};
int V[4] = {-1, 0, 1, 0};
char A[4] = {'<', 'V', '>', '^'};
char maze[MAX_SIZE][MAX_SIZE] =
{
{'x', 'x', 'x', 'x', 'x', 'x', 'x', 'x'},
{'o', 'o', 'o', 'o', 'o', 'x', 'x', 'x'},
{'x', 'o', 'x', 'x', 'x', 'x', 'x', 'x'},
{'x', 'o', 'x', 'x', 'x', 'x', 'x', 'x'},
{'x', 'o', 'x', 'x', 'x', 'x', 'x', 'x'},
{'x', 'o', 'x', 'x', 'o', 'o', 'o', 'x'},
{'x', 'o', 'o', 'o', 'o', 'x', 'o', 'o'},
{'x', 'x', 'x', 'x', 'x', 'x', 'x', 'x'}
};

void print()
{
    int i, j;
    for (i = 0; i < MAX_SIZE; i++)
    {
        for (j = 0; j < MAX_SIZE; j++)
            cout<<maze[i][j]<<' ';
        cout<<"\n";
    }
}

void findpath(int x, int y)
{
   
    //请补充该部分代码
    int mark[MAX_SIZE][MAX_SIZE]={0};
    stack<struct dir> st;
    int i, j, d;
    int g, h;
    struct dir tmp;
    tmp.x = x; tmp.y = y;tmp.d = 0;
    st.push(tmp);
    while (st.empty() == false)
    {
        tmp = st.top();
        st.pop();
        i = tmp.x; j = tmp.y; d = tmp.d;
        while (d < 4)
        {
            g = i + H[d]; h = j + V[d];
            if (maze[g][h] == 'o' && mark[g][h] == 0)
            {
                mark[g][h] = 1;
                maze[i][j] = A[d];
                tmp.x = i; tmp.y = j; tmp.d = d;
                st.push(tmp);
                i = g; j = h; d = 0;
            }
            else
                d++;
            if (i == 6 && j == 7)
            {
                cout<<"find path \n";
                print();
                return;
            }
        }

    }
    cout << "no path!\n";
}
int main()
{
    findpath(1, 0);
    return 0;
}