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)).

class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {

int m = nums1.size();
int n = nums2.size();

vector<int> sum;
int i=0;
int j=0;
while(i<m&&j<n)
{
if(nums1[i]>nums2[j])
{
sum.push_back(nums2[j]);
j++;
}
else
{
sum.push_back(nums1[i]);
i++;
}

}
while(i<m)
{
sum.push_back(nums1[i]);
i++;
}
while(j<n)
{
sum.push_back(nums2[j]);
j++;
}
return ((double)(sum[(m+n-1)/2]+sum[(m+n)/2]))/2;
}
};