Python Simple Two pointers
Extend j to the right as far as possible. Once we\'ve found a max distance we don\'t need to check any lengths smaller than that, so update i and j together.\n\
Extend j to the right as far as possible. Once we\'ve found a max distance we don\'t need to check any lengths smaller than that, so update i and j together.\n\n```\ndef maxDistance(self, nums1: List[int], nums2: List[int]) -> int:\n        i,j = 0,0\n        max_distance = 0\n        \n        while i < len(nums1) and j < len(nums2):\n            if nums1[i] <= nums2[j]:\n                max_distance = max(max_distance, j-i)\n                j += 1\n            else:\n                j += 1\n                i += 1\n\t\t\t\t\n        return max_distance\n```
['Python']