/*
一道比较简单的题目,就是合并两个有序的数组。
*/
class Solution {
public:double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
vector<int> nums;
int len1 = nums1.size();
int len2 = nums2.size();
int len = len1+len2;
int cur1=0,cur2=0;
double res = 0;
for(int i=0;i<len;i++){
if(cur1==len1){
nums.push_back(nums2[cur2]);
cur2++;
}
else if(cur2==len2){
nums.push_back(nums1[cur1]);
cur1++;
}
else if(nums1[cur1] <= nums2[cur2]){
nums.push_back(nums1[cur1]);
cur1++;
}
else{
nums.push_back(nums2[cur2]);
cur2++;
}
if(len%2==0 && i==len/2){
res = (nums[i]+nums[i-1])/2.0;
}
else if(len%2!=0 && i==len/2){
res = nums[i];
}
}
return res;
}
};