leetcode

0 class Solution {

1 public:

2 int findMiddleIndex(vector<int> &nums) {

3 int left = 0;

4 int right = accumulate(nums.begin(), nums.end(), 0);

5 for (int i = 0; i < nums.size(); left += nums[i++]) {

6 right -= nums[i];

7 if (left == right) return i;

8 }

9 return -1;

10 }

11 };