題目地址

https://leetcode.cn/problems/find-pivot-index/description/

題目描述

代碼

  class Solution {public int pivotIndex(int[] nums) {int total = Arrays.stream(nums).sum();//前綴和int prefixSum =0;int len = nums.length;for(int i =0;i<len;i++){if (i-1>=0){prefixSum+=nums[i-1];}//當前元素的后綴和 = total-nums[i]-prefixSumif((total-nums[i]-prefixSum)==prefixSum){return i;}}return -1;}
}