二分法yyds
暴力其实也可以
class Solution {
public int maxDistance(int[] nums1, int[] nums2) {
int max = -1;
for (int i = 0; i < nums1.length; i++) {
int left = i, right = nums2.length - 1;
while (left < right) {
int mid = left + (right - left + 1) / 2;
if (nums1[i] <= nums2[mid]) left = mid;
else right = mid - 1;
}
max = max > (left - i) ? max : (left - i);
}
return max == -1 ? 0 : max;
}
}