Algorithm
Maximum Distance Between a Pair of Values
Solution
class Solution:
def maxDistance(self, nums1: List[int], nums2: List[int]) -> int:
i, j = 0, 0
res = 0
while i < len(nums1) and j < len(nums2):
if nums1[i] <= nums2[j]:
res = max(res, j - i)
j += 1
else:
i += 1
return resTime Complexity
O(N + M)
Space Complexity
O(1)
