LeetCode 寻找两个正序数组的中位数(分治)

class Solution {
public:
    double median(vector<int> nums) {
        if (nums.size() % 2 == 0) {
            double dou0 = nums[nums.size() / 2];
            double dou1 = nums[nums.size() / 2 - 1];
            return (dou0 + dou1) / 2;
        }
        else {
            double dou0 = nums[nums.size() / 2];
            return dou0;
        }
    } 
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        if (nums1.size() == 0 && nums2.size() == 0)
            return 0;
        if (nums1.size() >= nums2.size()) {
            for (int i = 0; i < nums2.size(); i++) {
                nums1.push_back(nums2[i]);
            }
            sort(nums1.begin(), nums1.end());
            return median(nums1);
        }
        else {
            for (int i = 0; i < nums1.size(); i++) {
                nums2.push_back(nums1[i]);
            }
            sort(nums2.begin(), nums2.end());
            return median(nums2);
        }
    }
};