Find Pivot Index LeetCode solution in Java

1
class Solution {
2
  public int pivotIndex(int[] nums) {
3

4
    int leftsum = 0;
5
    int rightsum = 0;
6

7
    for (int i = 1; i < nums.length; i++) rightsum += nums[i];
8

9
    if (leftsum == rightsum) return 0;
10

11
    for (int i = 1; i < nums.length; i++) {
12
      leftsum += nums[i - 1];
13
      rightsum -= nums[i];
14

15
      if (leftsum == rightsum) return i;
16
    }
17
    return -1;
18
  }
19
}