Porn ⭐[MEGA.NZ]⭐ ❤️TEEN PACK LEAKS #18❤️ ( 3.3TB) 2024 V5

[28]

fsdfafa sdfdf

[48]

ty

[78]

thanks

[24]

tnx

[96]

The

[125]

Thanks m8!

[43]

class Solution {
    public int[] resultsArray(int[] nums, int k) {
        int n = nums.length;
        int[] ans = new int[n - k + 1];
        int cnt = 0; // Count of consecutive increasing numbers

        for (int i = 0; i < n - 1; i++) {
            // Check for increasing consecutive numbers
            if (nums[i + 1] == nums[i] + 1) {
                cnt++;
            } else {
                cnt = 0; // Reset count if not consecutive
            }

            // When we have enough elements to form a subarray of size k
            if (i - (k - 2) >= 0) {
                int idx = i - (k - 2); // Starting index of the subarray
                if (cnt >= k - 1) {
                    // Subarray meets the criteria
                    ans[idx] = nums[i + 1]; // Maximum element of the subarray
                } else {
                    // Subarray does not meet the criteria
                    ans[idx] = -1;
                }
            }
        }

        return ans;
    }
}

[10]

js

js