题目链接:
简洁STL
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
nums2.insert(nums2.end(), nums1.begin(), nums1.end());
sort(nums2.begin(), nums2.end());
int len = nums2.size();
return (len%2? nums2[len/2]: (nums2[len/2]+nums2[len/2-1])/2.0);
}
};
作者:liu-yong-qi
链接:https://leetcode-cn.com/problems/median-of-two-sorted-arrays/solution/3-xing-dai-ma-by-liu-yong-qi-3vmi/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
vector<int> ans(nums1.size()+nums2.size());
merge(nums1.begin(),nums1.end(),nums2.begin(),nums2.end(),ans.begin());
int n=ans.size();
return n&1?ans[n/2]/1.0:(ans[n/2]+ans[n/2-1])/2.0;
}
};
作者:hustle-u
链接:https://leetcode-cn.com/problems/median-of-two-sorted-arrays/solution/stlxue-de-hao-tou-fa-diao-de-shao-by-hus-a8qa/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。