Find the Power of K-Size Subarrays I

lcpy gen -n 3254   # by problem number
lcpy gen -s find_the_power_of_k_size_subarrays_i   # by problem name

Input: nums = [1,2,3,4,3,2,5]
Output: [3,4,-1,-1,-1]
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.

Input: nums = [2,2,2,2,2]
Output: [-1,-1]

Input: nums = [3,2,3,2,3,2]
Output: [-1,3,-1,3,-1]

class Solution:
    # Time: O(n)
    # Space: O(1) extra (output excluded)
    def results_array(self, nums: list[int], k: int) -> list[int]:
        # run[i] = length of the consecutive ascending run ending at index i
        results: list[int] = []
        run = 1
        for i, num in enumerate(nums):
            if i > 0 and num == nums[i - 1] + 1:
                run += 1
            else:
                run = 1
            if i >= k - 1:
                results.append(num if run >= k else -1)
        return results