长度为 K 的最大子数组

/*
 * Leetcode Problem: 1708. Largest Subarray Length K
 * 
 * Problem Statement:
 * Given an integer array nums and an integer k, find the largest subarray of length k.
 * 
 * Approach using Java Streams:
 * 1. Create a helper function to compare two subarrays.
 * 2. Use IntStream to generate the possible starting indices of subarrays of length k.
 * 3. Find the maximum starting index based on the subarray comparison.
 * 4. Return the subarray starting from the maximum index with length k.
 */

import java.util.stream.IntStream;

public int[] largestSubarrayStream(int[] nums, int k) {
    return IntStream.rangeClosed(0, nums.length - k)
                    .boxed()
                    .max((i, j) -> {
                        for (int l = 0; l < k; l++) {
                            if (nums[i + l] != nums[j + l]) {
                                return nums[j + l] - nums[i + l];
                            }
                        }
                        return 0;
                    })
                    .map(maxIndex -> java.util.Arrays.copyOfRange(nums, maxIndex, maxIndex + k))
                    .orElse(new int[0]);
}