链接:https://leetcode-cn.com/problems/find-pivot-index/
class Solution {
public int pivotIndex(int[] nums) {
if(nums.length<2){
return -1;
}
int sum=0;
int leftSum=0;
int rightSum=0;
for(int num:nums){
sum+=num;
}
for(int i=0;i<nums.length;i++){
if(i==0){
leftSum=0;
}else{
leftSum+=nums[i-1];
}
rightSum=sum-leftSum-nums[i];
if(rightSum==leftSum){
return i;
}
}
return -1;
}
}