class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int all = nums1.size() + nums2.size();
for (int i = 0; i < nums2.size(); i++)
{
nums1.push_back(nums2[i]);
}
sort(nums1.begin(), nums1.end());
if (all % 2 == 0)
{
return (nums1[all / 2 - 1] + nums1[all / 2]) / 2.0;
}
else
{
return (nums1[(all - 1) / 2] / 1.0);
}
}
};
评注:简单粗暴