题目: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)).
题目意思就是求两个有序序列的中位数,我的思想是一次遍历两个数组,按顺序将两个序列都插入新的序列中,组成新的有序序列v,然后判断新序列长度len为奇数还是偶数,奇数的话,则返回v[len/2],偶数的话返回(v[len/2] + v[len/2 - 1])/2.0。我的实现中只考虑两个数组均是递增序列,若一个递增,一个递减,或者均是递增呢,但还是ac啦,不明白,代码如下:
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
vector<int> nums;
int len1 = nums1.size();
int len2 = nums2.size();
int i = 0;
int j = 0;
while (i < len1 && j < len2){
if(nums1[i] < nums2[j]){
nums.push_back(nums1[i++]);
}
else if(nums1[i] > nums2[j]){
nums.push_back(nums2[j++]);
}
else{
nums.push_back(nums1[i++]);
nums.push_back(nums2[j++]);
}
}
while(i < len1){
nums.push_back(nums1[i++]);
}
while(j < len2){
nums.push_back(nums2[j++]);
}
int len = len1 + len2;
if(len % 2 == 0) //元素个数为偶数
{
return (nums[len/2 - 1] + nums[len/2]) / 2.0;
}
else
return double(nums[len/2]);
}
};