使数组相等的最小开销

/*
 * 思路：
 * 1. 使用Java Stream来简化计算和代码。
 * 2. 通过二分查找找到使总开销最小的目标值。
 * 3. 使用流来计算每个目标值对应的总开销。
 */
import java.util.stream.IntStream;

public class Solution {
    public long minCost(int[] nums, int[] cost) {
        int left = 1, right = 1000000;
        while (left < right) {
            int mid = (left + right) / 2;
            long cost1 = getCost(nums, cost, mid);
            long cost2 = getCost(nums, cost, mid + 1);
            if (cost1 > cost2) {
                left = mid + 1;
            } else {
                right = mid;
            }
        }
        return getCost(nums, cost, left);
    }

    private long getCost(int[] nums, int[] cost, int target) {
        return IntStream.range(0, nums.length)
                        .mapToLong(i -> (long) Math.abs(nums[i] - target) * cost[i])
                        .sum();
    }
}