题解 | 买橘子

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        System.out.println(minBagsBfs(n));
    }




    public static int minBagsBfs(int n) {
        int bags = 0;
        if (n < 6) {
            return 0;
        }
        Queue<Integer> queue = new LinkedList<>();
        queue.add(n);
        boolean[] isVis= new boolean[n+1];
        isVis[n] = true;

        while (!queue.isEmpty()) {
            int size = queue.size();
            bags++;
            for (int i = 0; i < size; i++) {
                int curren = queue.poll();
                // System.out.println("curren=" + curren);

                if (curren == 0) {
                    // System.out.println("curren==0")
                    return bags-1;
                }
                int min8 = curren - 8;

                // System.out.println("min8=" + min8);


                if (min8 >= 0 && !isVis[min8]) {
                    // queue.add(min8);
                    queue.add(min8);
                    isVis[min8] = true;
                }
                int min6 = curren - 6;
                if (min6 >= 0 &&!isVis[min6]) {
                    queue.add(min6);
                    isVis[min6]=true;
                }
            }


        }



        return -1;

    }


   
}