004-MedianOfTwoSortedArrays.py

# There are two sorted arrays nums1 and nums2 of size m and n respectively.
# Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
# You may assume nums1 and nums2 cannot be both empty.

class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        merged = self.merge(nums1, nums2)
        mid = (len(nums1) + len(nums2) - 1) // 2
        if (len(nums1) + len(nums2)) % 2 == 0:
            return (merged[mid] + merged[mid + 1]) / 2
        else:
            return merged[mid]

    def merge(self, nums1: List[int], nums2: List[int]): -> List[int]
        merged = []
        i = j = 0
        while i < len(nums1) and j < len(nums2):
            if nums1[i] <= nums2[j]:
                merged.append(nums1[i])
                i += 1
            else:
                merged.append(nums2[j])
                j += 1
        while i < len(nums1):
            merged.append(nums1[i])
            i += 1
        while j < len(nums2):
            merged.append(nums2[j])
            j += 1
        return merged