Maximum Distance Between a Pair of Values LeetCode solution in Java

1
class Solution {
2
  public int maxDistance(int[] nums1, int[] nums2) {
3
    int max = 0;
4
    for (int i = 0; i < nums1.length; i++) {
5
      int r = nums2.length - 1;
6
      int l = i;
7
      int m = i;
8
      while (l <= r) {
9
        m = l + (r - l) / 2;
10
        if (nums1[i] > nums2[m]) {
11
          r = m - 1;
12
        } else if (nums1[i] == nums2[m]) {
13
          l = m + 1;
14
        } else {
15
          l = m + 1;
16
        }
17
      }
18
      if (r < 0) {
19
        continue;
20
      }
21
      max = Math.max(max, r - i);
22
    }
23
    return max;
24
  }
25
}