https://leetcode.com/problems/median-of-two-sorted-arrays/
There are two sorted arrays nums1 and nums2 of size m and n respectively.
Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
You may assume nums1 and nums2 cannot be both empty.
Example 1:
nums1 = [1, 3] nums2 = [2] The median is 2.0
Example 2:
nums1 = [1, 2] nums2 = [3, 4] The median is (2 + 3)/2 = 2.5
代码:
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
vector<int> v;
for(int i = 0; i < nums1.size(); i ++)
v.push_back(nums1[i]);
for(int i = 0; i < nums2.size(); i ++)
v.push_back(nums2[i]);
sort(v.begin(), v.end());
double ans = 0.0;
if(v.size() % 2 == 0)
ans = 1.0 * (v[v.size() / 2 - 1] + v[v.size() / 2 + 1 - 1]) / 2;
else ans = 1.0 * v[(v.size() + 1) / 2 - 1];
return ans;
}
};
第一道 hard 题目 嘻嘻嘻
#Leetcode# 4. Median of Two Sorted Arrays
原文：https://www.cnblogs.com/zlrrrr/p/9994181.html