题目原址
https://leetcode.com/problems/find-pivot-index/description/
题目描述
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.
Example1:
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.
Example2:
Input: nums = [1, 2, 3]
Output: -1
Explanation:
There is no index that satisfies the conditions in the problem statement.
Note:
- The length of
nums
will be in the range[0, 10000]
. - Each element
nums[i]
will be an integer in the range[-1000, 1000]
.
解题思路
通过求和解决:
- 第一次遍历,求出数组的和
- 第二次遍历,左边的元素和 = 依次累加遍历到的元素的和,如何左边的元素和 = 总和 - 左边的元素和 - 当前元素。说明已经找到了第一个枢轴元素,直接返回该元素的下标
AC代码
class Solution {
public int pivotIndex(int[] nums) {
int length = nums.length;
int sum = 0;
int sumLeft = 0;
for(int i = 0; i <length; i++) {
sum += nums[i];
}
for(int i = 0; i <length; i++) {
if(i != 0)
sumLeft += nums[i-1];
if(sumLeft == sum - nums[i] - sumLeft)
return i;
}
return -1;
}
}