LC4. 最简单的双指针的解法

LC_4.py

class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        l1 = len(nums1)
        l2 = len(nums2)
        total_len = 0
        index1 = 0
        index2 = 0
        last1 = 0
        last2 = 0
        while True:
            last2 = last1
            if index1 == l1:
                last1 = nums2[index2]
                index2 += 1
            elif index2 == l2:
                last1 = nums1[index1]
                index1 += 1
            elif nums1[index1] <= nums2[index2]:
                last1 = nums1[index1]
                index1 += 1
            elif nums1[index1] > nums2[index2]:
                last1 = nums2[index2]
                index2 += 1
            else:
                print('error')
            total_len += 1
            if total_len == (l1 + l2)//2 + 1:
                break
        if (l1 + l2) % 2 == 0:
            return (last1 + last2)/2
        else:
            return last1