1
2
3
4
5
6
7
8
9
10
11
12
13
| class Solution {
public:
int pivotIndex(vector<int>& nums) {
int sum = accumulate(nums.begin(), nums.end(), 0);
int currSum = 0;
for (int i = 0; i < nums.size(); ++i) {
if (2 * currSum + nums[i] == sum)
return i;
currSum += nums[i];
}
return -1;
}
};
|