01010101001011001001010110010110100100001000101010
00001000100000101010010000100000001001100110100101
01111011010010001000001101001011100011000000010000
01000000001010100011010000101000001010101011001011
00011111000000101000010010100010100000101100000000
11001000110101000010101100011010011010101011110111
00011011010101001001001010000001000101001110000000
10100000101000100110101010111110011000010000111010
00111000001010100001100010000001000101001100001001
11000110100001110010001001010101010101010001101000
00010000100100000101001010101110100010101010000101
11100100101001001000010000010101010100100100010100
00000010000000101011001111010001100000101010100011
10101010011100001000011000010110011110110100001000
10101010100001101010100101000010100000111011101001
10000000101100010000101100101101001011100000000100
10101001000000010100100001000100000100011110101001
00101001010101101001010100011010101101110000110101
11001010000100001100000010100101000001000111000010
00001000110000110101101000000100101001001000011101
10100101000101000000001110110010110101101010100001
00101000010000110101010000100010001001000100010101
10100001000110010001000010101001010101011111010010
00000100101000000110010100101001000001000000000010
11010000001001110111001001000011101001011011101000
00000110100010001000100000001000011101000000110011
10101000101000100010001111100010101001010000001000
10000010100101001010110000000100101010001011101000
00111100001000010000000110111000000001000000001011
10000001100111010111010001000110111010101101111000

#include<iostream>
#include<queue>
using namespace std;

string g[30];
int st[30][50];

char dir[4] = {'D','L','R','U'};

int dx[4] = {1,0,0,-1};
int dy[4] = {0,-1,1,0};
struct point{
    int x,y;
    string path;
    point(int a,int b,string c):x(a),y(b),path(c){}
};

void bfs()
{
    queue<point> q;
    q.push(point(0,0,""));
    st[0][0] = 1;

    while(q.size())
    {
        int q_size = q.size();
        for(int i = 0; i < q_size;i++)
        {
            auto t = q.front();
            q.pop();
            int a = t.x;
            int b = t.y;

            if( a== 29 && b ==49)
            {
                cout << t.path;
                return;
            }
            for(int j = 0; j < 4;j++)
            {
                int x = a + dx[j];
                int y = b + dy[j];
                if( x<0 || x >=30 || y <0 || y >=50 || st[x][y] == 1 || g[x][y]== '1')
                    continue;
                st[x][y] = 1;
                q.push(point(x,y,t.path+dir[j]));
            }
        }

    }

}
int main()
{
    for(int i = 0; i <30;i++)
        cin >> g[i];
    cout << dir[0];
    bfs();
    return 0;
} 

跳蚱蜢

#include<iostream>
#include<unordered_set>
#include<queue>

using namespace std;

int dir[10][2];


int res = 0;

int bfs(string start,string end)
{

    queue<string> q;
    unordered_set<string> uset;
    q.push(start);
    uset.insert(start);

    while(q.size())
    {
        int q_size = q.size();
        for(int i = 0; i < q_size; i++)
        {
            auto t = q.front();
            q.pop();
            int k = t.find('X');
            //cout << k << endl;
            if(t==end)
                return res;
            for(int j = -2; j <=2;j++)
            {
                int x = k + j;
                if( x < 0)
                    x = 9 + x;
                else if (x >8)
                    x =  x-9;


                swap(t[k],t[x]);
                if(uset.count(t) == 0)
                {
                    q.push(t);
                    uset.insert(t);
                }
                swap(t[k],t[x]);    
            }
        }
        res++;
    }

    return -1;

}
int main()
{
    string start = "12345678X";
    string end = "87654321X";
    cout << bfs( start, end);

    return 0;
}