mirror of
https://github.com/Manoj-HV30/dsa-competitive-programming.git
synced 2026-05-16 19:35:22 +00:00
22 lines
643 B
C++
22 lines
643 B
C++
class Solution{
|
|
public :
|
|
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2){
|
|
int n = nums1.size();
|
|
int m = nums2.size();
|
|
vector<int> merger;
|
|
for(auto nums: nums1)
|
|
merger.push_back(nums);
|
|
for(auto nums : nums2)
|
|
merger.push_back(nums);
|
|
sort(merger.begin(), meger.end());
|
|
|
|
int size = meger.size();
|
|
if(size%2==1)
|
|
return (double) merger[size/2];
|
|
else
|
|
return (double) (merger[size/2]+ merger[size/2 - 1])/2.0;
|
|
|
|
|
|
}
|
|
};
|