leetcode-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:

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

/******暴力********/
class Solution {
public:
	double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
		vector<int> nums3;
		nums3.resize(nums1.size() + nums2.size());
		//sort(nums1.begin(), nums1.end());
		//sort(nums2.begin(), nums2.end());
		merge(nums1.begin(),nums1.end(),nums2.begin(),nums2.end(),nums3.begin());
		sort(nums3.begin(),nums3.end());
		double median = (double)( (nums3.size()% 2) ? nums3[nums3.size() >> 1] :( (double)(nums3[nums3.size() >> 1] + nums3[(nums3.size() - 1)>>1] )/(double)2 ) ); //注意类型转换
		return median;
	}
};