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