Last Moment Before All Ants Fall Out of a Plank LeetCode solution in Java

1
class Solution {
2
  public int getLastMoment(int n, int[] left, int[] right) {
3
    int max = 0;
4
    for (int i = 0; i < left.length; i++) {
5
      if (left[i] > max) max = left[i];
6
    }
7
    for (int i = 0; i < right.length; i++) {
8
      if (n - right[i] > max) max = n - right[i];
9
    }
10
    return max;
11
  }
12
}