寻找数组的中心索引 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.

• mode: easy
• tag: array

1. 分别计算左和与右和

分别计算数组每个位置的左边与右边的和（不包含当前元素），然后判断每个位置左和是否等于右和。左和、右和都存在向量中，所以内存消耗大。

C++

class Solution {
   
public:
    int pivotIndex(vector<int>& nums) {
   
        if(nums.size()==0)
            return -1;
        int nums_size=nums.size();
        vector<int> left_sum(nums_size);
        vector<int> right_sum(nums_size);
        
        left_sum[0]=0;
        for(int i=1;i<nums.size();i++)
        {
   
            left_sum[i] = left_sum[i-1] + nums[i-1];
        }
        
        right_sum