试题名称算法提高逃跑的牛 Java（BFS）

最新推荐文章于 2023-04-16 22:53:18 发布

Uranus^

最新推荐文章于 2023-04-16 22:53:18 发布

阅读量579

点赞数 1

CC 4.0 BY-SA版权

文章标签：蓝桥杯 java 算法

本文链接：https://blog.youkuaiyun.com/intwei/article/details/123702055

该程序实现了一个基于广度优先搜索(BFS)算法寻找从节点n到节点k的最短路径。输入包括两个整数n和k，表示起始和目标位置。BFS通过一个队列进行迭代，检查并标记已访问过的节点。当找到目标节点时，输出到达目标节点所需的步数。算法适用于无权图的最短路径查找，因为它总能找到最短路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >


import java.util.*;
public class Main{
    static boolean[] vis = new boolean[100005];
    static int n;
    static int k;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        k = sc.nextInt();
        bfs();
    }
    public static void bfs(){
        Queue<POS> q = new LinkedList<>();
        q.offer(new POS(n,0));
        vis[n] = true;
        while (!q.isEmpty()){
            POS now = q.poll();
            int now_position = now.position;
            int now_time = now.time;
            if(now_position == k){
                System.out.println(now_time);
                break;
            }
            int next_position = now_position+1;
            int next_time = now_time+1;
            if(check(next_position)){
                vis[next_position] = true;
                q.offer(new POS(next_position,next_time));
            }
            next_position = now_position-1;
            next_time = now_time+1;
            if(check(next_position)){
                vis[next_position] = true;
                q.offer(new POS(next_position,next_time));
            }
            next_position = now_position*2;
            next_time = now_time+1;
            if(check(next_position)){
                vis[next_position] = true;
                q.offer(new POS(next_position,next_time));
            }
        }
    }
    public static boolean check(int x){
        if(x >= 0 && x <= 100000 && vis[x] == false){
            return true;
        }
        return false;
    }
}
class POS{
    int position;
    int time;

    public POS(int position, int time) {
        this.position = position;
        this.time = time;
    }
}