4. Find the median of two positive arrays

Given two sizes, they are m and n Positive order of （ From small to large ） Array  nums1 and  nums2. Please find and return the values of these two positive ordered arrays Median .

The time complexity of the algorithm should be O(log (m+n)) .

Example 1：

Input ：nums1 = [1,3], nums2 = [2]
Output ：2.00000
explain ： Merge array = [1,2,3] , Median 2
Example 2：

Input ：nums1 = [1,2], nums2 = [3,4]
Output ：2.50000
explain ： Merge array = [1,2,3,4] , Median (2 + 3) / 2 = 2.5
 

Tips ：

nums1.length == m
nums2.length == n
0 <= m <= 1000
0 <= n <= 1000
1 <= m + n <= 2000
-106 <= nums1[i], nums2[i] <= 106

source ： Power button （LeetCode）

Force buckle code ：

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        double ans;
        int  size1=nums1.size(), size2=nums2.size();
        int size3=size1+size2;
        int nums3[size3];
        int i=0, j=0, k=0;
        while(i<size1||j<size2)
        {
          if(i<size1&&j==0)
          nums3[k++]=nums1[i++];
          else
          nums3[k++]=nums2[j++];
        }
        sort(nums3,nums3+size3);
        if(size3%2)
        {
            ans=nums3[(size3-1)/2];
        }
        else
        {
            ans=(nums3[size3/2]+nums3[size3/2-1])/2.0;
        }
         return ans;
    }
   
};