补给马车

/*
 * 思路：
 * 1. 使用Java Stream处理集合，查找最小相邻物资和并合并。
 * 2. 在每次迭代中，通过IntStream和Collectors实现合并操作。
 * 3. 重复该操作直到车队长度减半。
 */

import java.util.ArrayList;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class SolutionStream {
    public List<Integer> mergeSupplies(List<Integer> supplies) {
        while (supplies.size() > supplies.size() / 2) {
            int index = IntStream.range(0, supplies.size() - 1)
                    .boxed()
                    .min((i, j) -> {
                        int sumI = supplies.get(i) + supplies.get(i + 1);
                        int sumJ = supplies.get(j) + supplies.get(j + 1);
                        return sumI != sumJ ? Integer.compare(sumI, sumJ) : Integer.compare(i, j);
                    }).orElse(0);
            supplies = IntStream.range(0, supplies.size())
                    .filter(i -> i != index + 1)
                    .mapToObj(i -> i == index ? supplies.get(i) + supplies.get(i + 1) : supplies.get(i))
                    .collect(Collectors.toList());
        }
        return supplies;
    }

    public static void main(String[] args) {
        SolutionStream solution = new SolutionStream();
        List<Integer> supplies = new ArrayList<>(List.of(7, 3, 6, 1, 8));
        System.out.println(solution.mergeSupplies(supplies));
    }
}