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.

 

思路

1，空数组返回-1

2，数组长度为0，返回0；因为nums[0]将左右划分为0

3，将数组的左值设置为0，右值为除nums[0]以外的，也就是将nums[0]作为划分

      当不相等时，则左值加入nums[i] 右值减去nums[i+1] 此时nums[i+1]作为划分左右值的标志

#pragma once
#include <iostream>
#include<vector>
#include<numeric>
#include<algorithm>
using namespace std;

class Solution {
public:
	int pivotIndex(vector<int>& nums) {

		if (nums.size() == 0)//长度为0
		{
			return -1;
		}
		else if (nums.size() == 1)//长度为1
		{
			return 0;
		}
		int sum = accumulate(nums.begin(), nums.end(), 0);

		int leftsum = 0;//左值
		int rightsum = sum - nums[0];//右值，nums[0]是划分左右值的

		for (int i = 0; i < nums.size(); i++)
		{
			if (rightsum == leftsum)//左右相等，则返回
			{
				return i;
			}
			else if (i == nums.size() - 1)//防止最后一个数为划分左右值的标志
			{
				return -1;
			}
	

			leftsum += nums[i];//左边加入当前数
			rightsum -= nums[i + 1];//左边减去下一个数

		}
		return -1;

	}
				
};