K Radius Subarray Averages LeetCode solution in Python

1
# Runtime: 1318 ms (Top 77.1%) | Memory: 35.26 MB (Top 20.0%)
2

3

4
class Solution:
5
    def getAverages(self, nums: list[int], k: int) -> list[int]:
6

7
        n, diam = len(nums), 2 * k + 1
8
        if n < diam:
9
            return [-1] * n
10

11
        ans = [-1] * k
12

13
        arr = list(accumulate(nums, initial=0))
14

15
        for i in range(n - diam + 1):
16
            ans.append((arr[i + diam] - arr[i]) // diam)
17

18
        return ans + [-1] * k