寻找两个有序数组的中位数

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