# 724. Find Pivot Index

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.
``````

Example 2:

``````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]`.

``````class Solution {
public:
int pivotIndex(vector<int>& nums) {
int sum = accumulate(nums.begin(), nums.end(), 0);
int curSum = 0, n = nums.size();
for (int i = 0; i < n; ++i) {
if (sum - nums[i] == 2 * curSum) return i;
curSum += nums[i];
}
return -1;
}
};
``````

Subarray Sum Equals K

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation