Minimum Average Difference LeetCode solution in Python

1
from itertools import accumulate
2

3

4
class Solution:
5
    def minimumAverageDifference(self, nums: List[int]) -> int:
6
        size = len(nums)
7

8
        nums[::] = list(accumulate(nums))
9
        total = nums[-1]
10

11
        min_tuple = [0, sys.maxsize]
12

13
        for i, n in enumerate(nums):
14
            i = i + 1
15
            avg_i = floor(n / i)
16

17
            diff = size - i
18
            total_avg = floor((total - n) / (diff if diff > 0 else 1))
19

20
            avg = abs(avg_i - total_avg)
21
            if min_tuple[1] > avg:
22
                min_tuple[1] = avg
23
                min_tuple[0] = i - 1
24

25
        return min_tuple[0]