Package g2401_2500.s2420_find_all_good_indices

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2420 - Find All Good Indices\.

    Medium

    You are given a 0-indexed integer array nums of size n and a positive integer k.

    We call an index i in the range k <= i < n - k good if the following conditions are satisfied:

    • The k elements that are just before the index i are in non-increasing order.

    • The k elements that are just after the index i are in non-decreasing order.

    Return an array of all good indices sorted in increasing order.

    Example 1:

    Input: nums = 2,1,1,1,3,4,1, k = 2

    Output: 2,3

    Explanation: There are two good indices in the array:

    • Index 2. The subarray 2,1 is in non-increasing order, and the subarray 1,3 is in non-decreasing order.

    • Index 3. The subarray 1,1 is in non-increasing order, and the subarray 3,4 is in non-decreasing order.

    Note that the index 4 is not good because 4,1 is not non-decreasing.

    Example 2:

    Input: nums = 2,1,1,2, k = 2

    Output: []

    Explanation: There are no good indices in this array.

    Constraints:

    • n == nums.length

    • <code>3 <= n <= 10<sup>5</sup></code>

    • <code>1 <= numsi<= 10<sup>6</sup></code>

    • 1 &lt;= k &lt;= n / 2

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<Integer> goodIndices(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait