Find the Middle Index in Array LeetCode solution in Python

1
class Solution:
2
    def findMiddleIndex(self, nums: List[int]) -> int:
3
        A = [0] + list(accumulate(nums)) + [0]
4
        total, n = sum(nums), len(nums)
5
        for i in range(n):
6
            if A[i] == total - A[i] - nums[i]:
7
                return i
8
        return -1