有序数组中的缺失元素

/*
 * Problem: Missing Element in Sorted Array (Leetcode 1060)
 * This approach uses Java Streams to find the kth missing element.
 *
 * Approach:
 * 1. We first create a stream of all possible numbers from the minimum to the maximum in the given array.
 * 2. Filter out numbers that are present in the array, leaving only the missing ones.
 * 3. Collect the missing numbers and find the k-th missing number.
 */
import java.util.Arrays;
import java.util.Set;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class Solution {
    public int missingElement(int[] nums, int k) {
        Set<Integer> numSet = Arrays.stream(nums).boxed().collect(Collectors.toSet());
        return IntStream.range(nums[0], nums[nums.length - 1] + k + 1)
                        .filter(i -> !numSet.contains(i))
                        .skip(k - 1)
                        .findFirst()
                        .getAsInt();
    }
}