没看答案,按照题意,遍历每一个位置,并不断比较left和right的值是否相等即可。
class Solution:
def pivotIndex(self, nums: List[int]) -> int:
n = len(nums)
right = sum(nums)
left = 0
for i in range(n):
right -= nums[i]
if i >= 1:
left += nums[i-1]
if left == right:
return i
return -1