[LeetCode]4. Median of Two Sorte

题目

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)).

Example 1:

nums1 = [1, 3]
nums2 = [2]

The median is 2.0

Example 2:

nums1 = [1, 2]
nums2 = [3, 4]

The median is (2 + 3)/2 = 2.5

难度

Hard

方法

将nums1和nums2拼接，然后调用sorted()排序，取中间的数即可，当然也可以自己写归并排序

python代码

class Solution(object):
    def findMedianSortedArrays(self, nums1, nums2):
        """
        :param nums1: List[int]
        :param nums2: List[int]
        :return: float
        """
        nums = nums1 + nums2
        nums = sorted(nums)
        nums_len = len(nums)
        if nums_len % 2 == 0:
            return (nums[nums_len/2-1] + nums[nums_len/2]) / 2.0
        else:
            return nums[nums_len/2]


assert Solution().findMedianSortedArrays([1, 3], [2]) == 2
assert Solution().findMedianSortedArrays([1, 2], [3, 4]) == 2.5