[array]724. Find Pivot Index

724. Find Pivot Index

Description:

Given an array of integers nums, calculate the pivot index of this array.

The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index’s right.

If the index is on the left edge of the array, then the left sum is 0 because there are no elements to the left. This also applies to the right edge of the array.

Return the leftmost pivot index. If no such index exists, return -1.

Example 1:

Input: nums = [1,7,3,6,5,6]
Output: 3
Explanation:
The pivot index is 3.
Left sum = nums[0] + nums[1] + nums[2] = 1 + 7 + 3 = 11
Right sum = nums[4] + nums[5] = 5 + 6 = 11

Example 2:

Input: nums = [1,2,3]
Output: -1
Explanation:
There is no index that satisfies the conditions in the problem statement.

Example 3:

Input: nums = [2,1,-1]
Output: 0
Explanation:
The pivot index is 0.
Left sum = 0 (no elements to the left of index 0)
Right sum = nums[1] + nums[2] = 1 + -1 = 0

Constraints:

1 <= nums.length <= 104
-1000 <= nums[i] <= 1000

hint1

We can precompute prefix sums P[i] = nums[0] + nums[1] + … + nums[i-1]. Then for each index, the left sum is P[i], and the right sum is P[P.length - 1] - P[i] - nums[i].

solution1 前缀和

思路

记数组的全部元素之和为 \textit{total}total，当遍历到第 ii 个元素时，设其左侧元素之和为 \textit{sum}sum，则其右侧元素之和为 \textit{total}-\textit{nums}_i-\textit{sum}total−nums i −sum。左右侧元素相等即为 \textit{sum}=\textit{total}-\textit{nums}_i-\textit{sum}sum=total−nums
i −sum，即 2\times\textit{sum}+\textit{nums}_i=\textit{total}2×sum+nums
i =total。

当中心索引左侧或右侧没有元素时，即为零个项相加，这在数学上称作「空和」（\text{empty sum}empty sum）。在程序设计中我们约定「空和是零」。

代码

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

复杂度分析

时间复杂度：O(n)O(n)，其中 nn 为数组的长度。

空间复杂度：O(1)O(1)。

作者：LeetCode-Solution
链接：https://leetcode.cn/problems/find-pivot-index/solution/xun-zhao-shu-zu-de-zhong-xin-suo-yin-by-gzjle/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

---

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