g2401_2500.s2420_find_all_good_indices.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g2401_2500.s2420_find_all_good_indices;
// #Medium #Array #Dynamic_Programming #Prefix_Sum
// #2022_11_18_Time_13_ms_(82.76%)_Space_111.2_MB_(78.83%)
import java.util.ArrayList;
import java.util.List;
public class Solution {
public List goodIndices(int[] nums, int k) {
int amount = 1;
List result = new ArrayList<>();
if (k == 1) {
for (int i = 1; i < nums.length - 1; i++) {
result.add(i);
}
return result;
}
for (int left = 1, right = k + 2; right < nums.length; left++, right++) {
if (nums[left - 1] >= nums[left] && nums[right - 1] <= nums[right]) {
amount++;
if (amount >= k) {
result.add(left + 1);
}
} else {
amount = 1;
}
}
return result;
}
}