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

Subscribe to see which companies asked this question.

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        vector<int> addup;
        int tag1=0,tag2=0;
        while(tag1!=nums1.size() && tag2!=nums2.size())
        {
            if(nums1[tag1]<nums2[tag2])
            {
                addup.push_back(nums1[tag1]);
                tag1++;
            }
            else
            {
                addup.push_back(nums2[tag2]);
                tag2++;
            }
            //cout<<addup[addup.size()-1]<<" ";
        }
        while(tag2!=nums2.size())
        {
            addup.push_back(nums2[tag2]);
            tag2++;
        }
        while(tag1!=nums1.size())
        {
            addup.push_back(nums1[tag1]);
            tag1++;
        }
        if((tag1+tag2)%2==0) return (double(addup[(tag1+tag2)/2])+double(addup[(tag1+tag2)/2-1]))/2;
        else return double(addup[(tag1+tag2)/2]);
    }
};