Leetcode-1991. Find the Middle Index in Array

Topic Background

Given a 0-indexed integer array nums, find the leftmost iddleIndex (i.e., the smallest amongst all the possible ones).

A middleIndex is an index where nums[0] + nums[1] + … +nums[middleIndex-1] == nums[middleIndex+1] + nums[middleIndex+2] + … + nums[nums.length-1].
If middleIndex == 0, the left side sum is considered to be 0.
Similarly, if middleIndex == nums.length - 1, the right side sum is considered to be 0.
Return the leftmost middleIndex that satisfies the condition, or -1 if there is no such index.

---

Example 1:

Input: nums = [2,3,-1,8,4]
Output: 3
Explanation: The sum of the numbers before index 3 is: 2 + 3 + -1 = 4 The sum of the numbers after index 3 is: 4 = 4
Example 2:

Input: nums = [1,-1,4]
Output: 2 Explanation: The sum of the numbers before index 2 is: 1 + -1 = 0 The sum of the numbers after index 2 is:0
Example 3:

Input: nums = [2,5]
Output: -1 Explanation: There is no valid middleIndex.

Constraints:

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

Solution1

开始用暴力没有解出，后看到解法中的公式属实没转过这个弯来，不由赞叹高斯小时候就能算1到100和的解法确实天才。
C++库函数的accumulate()大概是今天的收获。

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int findMiddleIndex(vector<int>& nums) {
	int sum = accumulate(nums.begin(),nums.end(),0);
	int mid = 0;
	for(int i=0;i<nums.size();i++){
		if(mid*2+nums[i]==sum)
			return i;
		mid+=nums[i];
	}
	return -1;
} 
int main(){
	vector<int> nums = {4,0};
	cout<<findMiddleIndex(nums)<<endl;
	return 0;
}