Leetcode-4. Median of Two Sorted Arrays

Topic background

Given two sorted arrays nums1 and nums2 of size m and n respectively,
return the median of the two sorted arrays.

The overall run time complexity should be O(log (m+n)).
Example 1:

Input: nums1 = [1,3], nums2 = [2]
Output: 2.00000
Explanation: merged array = [1,2,3] and median is 2.

Example 2:

Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.50000
Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.

Constraints:

nums1.length == m nums2.length == n
0 <= m <= 1000
0 <= n <= 1000
1 <=> m + n <= 2000
-10^6 <= nums1[i], nums2[i] <= 10 ^6

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/median-of-two-sorted-arrays
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

Solution 1

简单轮子版

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
	for(auto i:nums2)
		nums1.push_back(i);
	sort(nums1.begin(),nums1.end());
	if(nums1.size()%2==0){
		return(nums1[nums1.size()/2-1]+nums1[nums1.size()/2])/2.0;
	}
	else{
		return nums1[nums1.size()/2.0];
	}
	return 0;
    }
};