Number of Ways to Split Array LeetCode solution in Java

1
class Solution {
2
  public int waysToSplitArray(int[] nums) {
3
    long sum = 0;
4
    for (int i : nums) {
5
      sum += i;
6
    }
7
    int sol = 0;
8
    long localSum = 0;
9
    for (int i = 0; i < nums.length - 1; i++) {
10
      localSum += nums[i];
11
      if (localSum >= sum - localSum) {
12
        sol++;
13
      }
14
    }
15
    return sol;
16
  }
17
}