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) {        if (0 == (nums1.size() + nums2.size()))        {            return 0.0;        }        vector<int> tmp;        tmp.reserve(nums1.size() + nums2.size());        int i = 0, j = 0;        for (; ((i < nums1.size()) && (j < nums2.size())); )        {            if (nums1[i] < nums2[j])            {                tmp.push_back(nums1[i++]);                 }            else            {                tmp.push_back(nums2[j++]);            }                       }        if (i < nums1.size())        {            for (int l = i; l < nums1.size(); l++)            {                tmp.push_back(nums1[l]);            }        }        else        {            for (int l = j; l < nums2.size(); l++)            {                tmp.push_back(nums2[l]);            }        }        if (1 == tmp.size())        {            return (double)tmp[0];        }        else if (0 == (tmp.size()%2))        {            return ((double)tmp[tmp.size()/2] + (double)tmp[tmp.size()/2 - 1])/2.0;        }        else        {            return (double)tmp[tmp.size()/2];        }                    }};