4. Median of Two Sorted Arrays

https://leetcode.com/problems/median-of-two-sorted-arrays/

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

insert函数第一个参数是插入新元素的位置，第二，三个参数是插入新元素的区间。