4. Median of Two Sorted Arrays
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:
1 nums1 = [1, 3] 2 nums2 = [2] 3 4 The median is 2.0
Example 2:
1 nums1 = [1, 2] 2 nums2 = [3, 4] 3 4 The median is (2 + 3)/2 = 2.5
1 class Solution: 2 def findMedianSortedArrays(self, nums1, nums2): 3 """ 4 :type nums1: List[int] 5 :type nums2: List[int] 6 :rtype: float 7 """ 8 nums1.extend(nums2) 9 nums1.sort() 10 len1=len(nums1) 11 if len1: 12 if len1%2==0: 13 return (nums1[len1//2]+nums1[len1//2-1])/2 14 else: 15 return nums1[len1//2]
1 def main(nums1,nums2): 2 nums1.extend(nums2) 3 nums1.sort() 4 len1=len(nums1) 5 if len1: 6 if len1%2==0: 7 return (nums1[len1//2]+nums1[len1//2-1])/2 8 else: 9 return nums1[len1//2] 10 # print(l1) 11 if __name__ == '__main__': 12 l1=[1,3] 13 l2=[2] 14 print(main(l1,l2))