letCode Median of Two Sorted Arrays (#4)

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

解题思路：将两个表合并后排序，找到其中位数

代码如下：

def findMedianSortedArrays(self, nums1, nums2):
    nums1 = nums1+nums2
    nums1.sort()
    size = len(nums1)
    return  nums1[size//2] if size%2 else (nums1[(size-1)//2]+nums1[(size)//2])/2.0