[binary search - medium] 1855 Maximum distance of subscript alignment (need to review double pointer method)

subject
Example 1：

Input ：nums1 = [55,30,5,4,2], nums2 = [100,20,10,10,5]
Output ：2
explain ： The valid subscript pair is (0,0), (2,2), (2,3), (2,4), (3,3), (3,4) and (4,4) .
The maximum distance is 2 , Corresponding subscript pair (2,4) .

Example 2：

Input ：nums1 = [2,2,2], nums2 = [10,10,1]
Output ：1
explain ： The valid subscript pair is (0,0), (0,1) and (1,1) .
The maximum distance is 1 , Corresponding subscript pair (0,1) .

Example 3：

Input ：nums1 = [30,29,19,5], nums2 = [25,25,25,25,25]
Output ：2
explain ： The valid subscript pair is (2,2), (2,3), (2,4), (3,3) and (3,4) .
The maximum distance is 2 , Corresponding subscript pair (2,4) .

Tips ：

1 <= nums1.length <= 105
1 <= nums2.length <= 105
1 <= nums1[i], nums2[j] <= 105
nums1  and  nums2  All are   Non-increasing   Array 

【 Code 1： Two point search 】
Execution time ：796 ms, In all Python3 Defeated in submission 10.69% Users of
Memory consumption ：28.8 MB, In all Python3 Defeated in submission 73.10% Users of
Pass the test case ：32 / 32

class Solution:
    def maxDistance(self, nums1: List[int], nums2: List[int]) -> int:
        maxSpan=0
        for idx,item in enumerate(nums1):
            # Find from left to right  num2 in   the last one >=item The subscript of the number 
            left,right,ans=idx,len(nums2)-1,-1
            while left<=right:
                mid=left+(right-left)//2
                if nums2[mid]>=item:
                    ans=mid
                    left=mid+1
                else:
                    right=mid-1
            # print("cur:",item," ",left,right," ans:",ans)
            if ans!=-1:
                maxSpan=max(maxSpan,ans-idx)
        return maxSpan

【 Method 2： Double pointer 】
Execution time ：108 ms, In all Python3 Defeated in submission 99.31% Users of
Memory consumption ：28.8 MB, In all Python3 Defeated in submission 51.72% Users of
Pass the test case ：32 / 32

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