Median of Two Sorted Arrays
来源:互联网 发布:scrambling 算法 编辑:程序博客网 时间:2024/05/14 22:57
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int m=nums1.size();
int n=nums2.size();
int min1=min(m,n);
vector<int>nums3(n+m,0);
int i=0,j=0,k=0;
for( i=0,j=0;i<m&&j<n;k++) //归并排序;
{
if(nums1[i]>nums2[j])
{
nums3[k]=nums2[j];
j++;
}
else{
nums3[k]=nums1[i];
i++;
}
}
if(i==m) while(j<n) nums3[k++]=nums2[j++];
else if(j==n) while(i<m) nums3[k++]=nums1[i++];
if((n+m)%2==0) return (nums3[(n+m)/2]+nums3[(n+m)/2-1])/2.0;
else return nums3[(n+m)/2];
}
};
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int m=nums1.size();
int n=nums2.size();
int min1=min(m,n);
vector<int>nums3(n+m,0);
int i=0,j=0,k=0;
for( i=0,j=0;i<m&&j<n;k++) //归并排序;
{
if(nums1[i]>nums2[j])
{
nums3[k]=nums2[j];
j++;
}
else{
nums3[k]=nums1[i];
i++;
}
}
if(i==m) while(j<n) nums3[k++]=nums2[j++];
else if(j==n) while(i<m) nums3[k++]=nums1[i++];
if((n+m)%2==0) return (nums3[(n+m)/2]+nums3[(n+m)/2-1])/2.0;
else return nums3[(n+m)/2];
}
};
0 0
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of two sorted arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- median-of-two-sorted-arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- Median of Two Sorted Arrays
- 线段树 hdu1828 Picture
- 无限极分类获取子孙树
- 核心动画 CoreAnimation
- scrapy学习笔记--Items
- 32位和64位系统区别和数据字节
- Median of Two Sorted Arrays
- hdu 2005 第几天?
- wget显示请求和响应的headers
- 第六章 并发:死锁与饥饿
- hdu5355
- 黑马程序员——多态
- Java小游戏之打飞机(二)
- 花生采摘
- Jetty