Find the Middle Index in Array LeetCode solution in Java

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

4
    for (int i = 0; i < nums.length; i++) {
5
      int rsum = 0;
6
      int lsum = 0;
7

8
      for (int k = 0; k < i; k++) lsum += nums[k];
9
      for (int k = i + 1; k < nums.length; k++) rsum += nums[k];
10

11
      if (lsum == rsum) {
12
        return i;
13
      }
14
    }
15

16
    return -1;
17
  }
18
}