Number of Ways to Split Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  int waysToSplitArray(vector<int> &nums) {
4
    long long sumFromBack(0), sumFromFront(0);
5
    for (auto &i : nums) sumFromBack += i;
6

7
    int n(size(nums)), res(0);
8
    for (auto i = 0; i < n - 1; i++) {
9
      sumFromFront += nums[i]; // sum of the first i + 1 elements
10
      sumFromBack -= nums[i];  // sum of the last n - i - 1 elements.
11
      if (sumFromFront >= sumFromBack) res++;
12
    }
13
    return res;
14
  }
15
};