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
Method 1. a=(最大+最小)/ 2,如果a在 nums1或者在nums2里,则 a=(a+最大)/2
Method 2. nums1,nums2并成一个有序新的list ,直接(最大+最小)/2