4. Median of Two Sorted Arrays

Problem Description:

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.

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

 

My Solution: 

class Solution:
     def findMedianSortedArrays(self, nums1, nums2):
         """
         :type nums1: List[int]
         :type nums2: List[int]
         :rtype: float
         """
         # 思路 直接合并两数组 并重排序 然后判断数组长度奇偶性 即可 
         nums1 = sorted(nums1 + nums2)
         n = len(nums1)     
         if n%2==0:                                  
             return (nums1[n//2]+nums1[n//2-1])/2    
         else:               
             return nums1[n//2]
# 采用地板除 // 栗子：3//2 == 1
# 一般除法 3/2 == 1.5