Count Strictly Increasing Subarrays

lcpy gen -n 2393   # by problem number
lcpy gen -s count_strictly_increasing_subarrays   # by problem name

Input: nums = [1,3,5,4,4,6]
Output: 10
Explanation: The strictly increasing subarrays are the following:
- Subarrays of length 1: [1], [3], [5], [4], [4], [6].
- Subarrays of length 2: [1,3], [3,5], [4,6].
- Subarrays of length 3: [1,3,5].
The total number of subarrays is 6 + 3 + 1 = 10.

Input: nums = [1,2,3,4,5]
Output: 15
Explanation: Every subarray is strictly increasing. There are 15 possible subarrays that we can take.

class Solution:
    # Time: O(n)
    # Space: O(1)
    def count_strictly_increasing(self, nums: list[int]) -> int:
        total = 0
        run = 0
        prev = 0
        for i, x in enumerate(nums):
            if i > 0 and x > prev:
                run += 1
            else:
                run = 1
            total += run
            prev = x
        return total