[LeetCode]724. Find Pivot Index 解题报告(C++)

[LeetCode]724. Find Pivot Index 解题报告(C++)

题目描述

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.

题目大意

• 给定一个数组.返回一个 pivot index 使得左右两边和相同.

解题思路

方法1:

• 遍历数组用 p[i]来记录 0…i-1的和.

代码实现:

class Solution {
public:
    int pivotIndex(vector<int>& nums) {
        int n = nums.size();
        if (n < 1) {
            return -1;
        }
        // 开辟 n+1 的空间
        // i索引左边和:
        // p[i] 表示由 nums[0]+nums[1] + ... +num[i-1] 的和
        // i索引右边和:
        // p[n] 表示所有和,右边和为: P[n]-p[i]-nums[i]
        int *p = new int[n + 1];

        p[0] = 0;
        for (int i = 1; i <n+1; i++) {
            p[i] = nums[i-1] + p[i - 1];
        }

        int left_sum = 0, right_sum = 0;
        for (int i = 0; i<n; i++) {
            left_sum = p[i];
            right_sum = p[n] - p[i]-nums[i];
            if (left_sum == right_sum) {
                return i;
            }
        }
        return -1;
    }
}; 

方法2:

• 求总的和.
• 遍历数组.记录遍历过的数的和. cursum.
• 检查 sum - tmp (当前遍历到的数值)= 2*cursum

代码实现:

C++
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;
}
};


---