C++实现,寻找两个有序数组的中位数
自己敲的渣渣代码:
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
/*
将两个数组合并同一个数组,然后进行排序,通过判断是奇数位数组还是偶数位的数组,来进一步找出中位数
*/
int m = nums1.size();
int n = nums2.size();
int size1;
size1 = m + n;
int middle;
double temp;
int index1, index2;
vector<double> nums3(size1);
for(int i = 0; i < m; i++)
{
nums3[i] = nums1[i];
}
for(int i = 0; i < n; i++)
{
nums3[i + m] = nums2[i];
}
sort(nums3.begin(), nums3.end());
if((size1 % 2) != 0)
{
middle = size1 / 2;
return nums3[middle];
}
else
{
index1 = (size1 / 2) - 1;
index2 = size1 / 2;
temp = (nums3[index1] + nums3[index2]) * 1.0 / 2.0;
return temp;
}
}
};
大佬们敲的代码:
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
double a;
int b;
vector<double>nums3;
nums3.insert(nums3.end(), nums1.begin(), nums1.end());
nums3.insert(nums3.end(), nums2.begin(), nums2.end());
int n = nums3.size();
sort(nums3.begin(), nums3.end());
if (n % 2 == 0){
a = double((nums3[n / 2] + nums3[(n / 2) - 1]) / 2);//int到double的强制类型转换
}
else{
a = double(nums3[n / 2]);
}
return a;
}
};
利用auto实现:
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int m = nums1.size();
int n = nums2.size();
vector<int> nums3;
for (auto a : nums1)
nums3.push_back(a);
for (auto b : nums2)
nums3.push_back(b);
for (auto c : nums3){
cout << c << endl;
}
cout << "*****************" << endl;
sort(nums3.begin(), nums3.end());
int middle;
double temp;
int len = nums3.size();
int index, index1, index2;
if ((len % 2) == 0)
{
index1 = len / 2;
index2 = len / 2 - 1;
temp = (nums3[index1] * 1.0 + nums3[index2] * 1.0) * 1.0 / 2.0;
return (double)temp;
}
else
{
middle = len / 2;
return nums3[middle];
}
}
};