Count Subarrays With Score Less Than K LeetCode solution in Python

1
class Solution:
2
    def countSubarrays(self, nums: List[int], k: int) -> int:
3
        sum, res, j = 0, 0, 0
4
        for i, n in enumerate(nums):
5
            sum += n
6
            while sum * (i - j + 1) >= k:
7
                sum -= nums[j]
8
                j += 1
9
            res += i - j + 1
10
        return res