Find Pivot Index LeetCode solution in C++

1
class Solution {
2
 public:
3
  int pivotIndex(vector<int> &nums) {
4
    int sum = 0, leftSum = 0;
5
    for (int &n : nums) {
6
      sum += n;
7
    }
8
    for (int i = 0; i < nums.size(); i++) {
9
      if (leftSum == sum - leftSum - nums[i]) {
10
        return i;
11
      }
12
      leftSum += nums[i];
13
    }
14
    return -1;
15
  }
16
};