题目描述
题目链接
使用algorithm的题解
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
if (nums1.size() == 0 && nums2.size() == 0) {
return 0;
}
int pos1 = nums1.size();
int pos2 = nums2.size();
nums1.resize(pos1 + pos2);
copy(nums2.begin(), nums2.end(), nums1.begin() + pos1);
sort(nums1.begin(), nums1.end());
if (nums1.size() % 2 == 1) {
int mid = (nums1.size() - 1) / 2;
return nums1[mid];
}
else {
int mid = nums1.size() / 2;
return (double)(nums1[mid] + nums1[mid - 1]) / (double)2;
}
}
};
参考链接