Leetcode 1855. Maximum Distance Between a Pair of Values

class Solution:
    def maxDistance(self, nums1: List[int], nums2: List[int]) -> int:
        distance = 0
        i = 0
        j = 0
        while i < len(nums1) and j < len(nums2):
            if i <= j:
                if nums1[i] <= nums2[j]:
                    distance = max(distance, j - i)
                    j += 1
                else:
                    i += 1
            else:
                j += 1
        return distance

class Solution:
    def maxDistance(self, nums1: List[int], nums2: List[int]) -> int:
        distance = 0
        i = 0
        j = 0
        while i < len(nums1) and j < len(nums2):
            if nums1[i] > nums2[j]:
                i += 1
            else:
                distance = max(distance, j - i)
                j += 1
        return distance