Given an array of integers nums
, write a method that returns the "pivot" index of this array.
We define the pivot index as the index where the sum of the numbers to the left of the index is equal to the sum of the numbers to the right of the index.
If no such index exists, we should return -1. If there are multiple pivot indexes, you should return the left-most pivot index.
Example 1:
Input:
nums = [1, 7, 3, 6, 5, 6]
Output: 3
Explanation:
The sum of the numbers to the left of index 3 (nums[3] = 6) is equal to the sum of numbers to the right of index 3.
Also, 3 is the first index where this occurs.
思路:就是prefixsum,但是这里可以简化点;直接用totalsum和presum解决;
class Solution {
public int pivotIndex(int[] nums) {
int totalsum = 0;
for(int num: nums) {
totalsum += num;
}
int presum = 0;
for(int i = 0; i < nums.length; i++) {
if(presum == totalsum - presum - nums[i]) {
return i;
}
presum += nums[i];
}
return -1;
}
}