【LC】4. 寻找两个正序数组的中位数

---

题目描述

题解

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        int totalsize = nums1.size() + nums2.size();
        if (totalsize == 0) return 0;
        int midpos = totalsize / 2;
        vector<int> newnums;
        newnums.reserve(totalsize);
        for (const auto& x : nums1)
        {
            newnums.push_back(x);
        }
        for (const auto& x : nums2)
        {
            newnums.push_back(x);
        }
        std::sort(newnums.begin(), newnums.end());
        if (totalsize % 2 == 0)
        {
            return (double)(newnums[midpos - 1] + newnums[midpos]) / 2;
        }
        return newnums[midpos];
    }
};