4. Median of Two Sorted Arrays Hard

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

思路：将两个数组合成一个数组，从小到大排序，找到中位数。　合并时若是使用比较插入，复杂度为Ｏ(n^2)。因此我们使用新的数组

存储，循环，每次将两个数组中的较小数放入数组中，最后将剩下的数放入，复杂度为O(max(m,n))。

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        vector<int>result;
        int a = nums1.size();
        int b = nums2.size();
        int q = 0, w = 0;
        while (q < a && w < b) {
            if (nums1[q] < nums2[w]) {
                result.push_back(nums1[q]);
                q++;
            } else {
                result.push_back(nums2[w]);
                w++;
            }
        }
        while (q < a) {
            result.push_back(nums1[q]);
            q++;
        }
        while (w < b) {
            result.push_back(nums2[w]);
            w++;
        }
        int count = result.size();
        double ans;
        if (count % 2 == 0) {
            count = count / 2;
            ans = result[count - 1] + result[count];
            ans = ans / 2.0;
        } else {
            count = count / 2;
            ans = double(result[count]);
        }
        return ans;
    }
};