C++ 代码

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int n,k,vis[100005];
void bfs()
{
    queue<int> q;
    q.push(n);
    while(!q.empty())
    {
        int cur=q.front();
        q.pop();
        if(cur==k)
            cout<<vis[k];
        if(cur+1<=100000 and !vis[cur+1])
        {
            vis[cur+1]=vis[cur]+1;
            q.push(cur+1);
        }
        if(cur-1>=0 and !vis[cur-1])
        {
            vis[cur-1]=vis[cur]+1;
            q.push(cur-1);
        }
        if(cur*2<=100000 and !vis[cur*2])
        {
            vis[cur*2]=vis[cur]+1;
            q.push(cur*2);
        }
    }
}
int main()
{
    cin>>n>>k;
    bfs();
    return 0;
}