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) {
        if (nums.size() == 0) return -1;
        int left = 0, right = nums.size() - 1;
        int leftCount = nums[left], rightCount = nums[right];
        while (left < right) {
            if (leftCount < rightCount) {
                left++;
                leftCount += nums[left];
            }
            else if (leftCount > rightCount) {
                right--;
                rightCount += nums[right];
            }
            else {
                if (left + 2 == right)
                    return left + 1;
                else {
                    left++;
                    leftCount += nums[left];
                    right--;
                    rightCount += nums[right];
                }
            }
        }
        return -1;
    }
};

代码有误

后面发现过不了测试样例，原因是数组元素有负数啊，如果左边小于右边，那可能是左边右移加上正数也可能是右边左移加上负数。因此这就存在不确定性了。后面看了别人代码如下：

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

            return -1;
        }
    };

真的是很简单啊~~~