3255. Find the Power of K-Size Subarrays II
3255. Find the Power of K-Size Subarrays II
Description
You are given an array of integers nums
of length n
and a positive integer k
.
The power of an array is defined as:
- Its maximum element if all of its elements are consecutive and sorted in ascending order.
- -1 otherwise.
You need to find the power of all subarrays of nums
of size k
.
Return an integer array results
of size n - k + 1
, where results[i]
is the power of nums[i..(i + k - 1)]
.
Example 1:
1 | Input: nums = [1,2,3,4,3,2,5], k = 3 |
Explanation:
There are 5 subarrays of nums
of size 3:
[1, 2, 3]
with the maximum element 3.[2, 3, 4]
with the maximum element 4.[3, 4, 3]
whose elements are not consecutive.[4, 3, 2]
whose elements are not sorted.[3, 2, 5]
whose elements are not consecutive.
Example 2:
1 | Input: nums = [2,2,2,2,2], k = 4 |
Example 3:
1 | Input: nums = [3,2,3,2,3,2], k = 2 |
Constraints:
1 <= n == nums.length <= 10^5
1 <= nums[i] <= 10^6
1 <= k <= n
Hints/Notes
- 2024/08/17
- Sliding window
- The same as 3254
- 0x3Fâs solution(checked)
- Biweekly Contest 137
Solution
Language: C++
1 | class Solution { |