Java:
class Solution {
public int pivotIndex(int[] nums) {
int sum=0,sum_piv=0;
for(int i=0;i<nums.length;i++) sum+=nums[i];
for(int i=0;i<nums.length;i++){
if(sum_piv*2==sum-nums[i]) return i;
sum_piv+=nums[i];
}
return -1;
}
}
python3:
class Solution:
def pivotIndex(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
num_l,num_r=0,sum(nums)
for index,num in enumerate(nums):
num_r-=num
if num_l==num_r:
return index
num_l+=num
return -1