4. Median of Two Sorted Arrays

class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        nums = nums1 + nums2
        #print(nums)
        nums.sort() #排序的时间为O(log(m+n))即可
        #print(nums)
        num_len = len(nums)
        half_num_len = num_len // 2
        if num_len % 2 == 0:
            return (nums[half_num_len - 1] + nums[half_num_len]) / 2
        else:
            return nums[(num_len+1) // 2 - 1]