leetcode第四题.：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

解题：此题目可有多种解决方法，我才用了数据结构中的归并算法的思想，首先将给定的两个已经排序好的数组用归并算法合成一个数组，合成的数组也是排序好的，然后在合成后的数组中取中间点。具体代码如下：

double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) 
{
vector<int>nums3;
int i = 0;int j = 0;
while(i<nums1.size() && j<nums2.size())
{
   if(nums1[i]<=nums2[j])
   {
       nums3.push_back(nums1[i]);
       i++;
   }
   else
   {
       nums3.push_back(nums2[j]);
       j++;
   }
}
while(i<nums1.size())
{
   nums3.push_back(nums1[i]);
   i++;
}
while(j<nums2.size())
{
   nums3.push_back(nums2[j]);
   j++;
}
if(nums3.size()%2==0)
{
   return double(nums3[nums3.size()/2-1]+nums3[nums3.size()/2])/2;
}
else
{
   return nums3[int(nums3.size()/2)];
}
}