4：Median of Two Sorted Arrays
here 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)).
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
答案：
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int len1 = nums1.length,len2 = nums2.length;
int len = len1 + len2;
int mod = len%2;
int start = 0;
int middle = len/2;
int temp = 0;
int index1 = 0,index2 = 0;
while(index1<len1 || index2 < len2){
if(index2 == len2 || (index1 < len1 && nums1[index1]<=nums2[index2])){
if(mod==1){
if(start == middle){
return nums1[index1];
}
}else{
if(start == middle - 1){
temp = nums1[index1];
}
if(start == middle){
return ((double)temp + (double)nums1[index1])/2;
}
}
index1++;
}else if(index1 == len1 || (index2 < len2 && nums1[index1]>nums2[index2])){
if(mod==1){
if(start == middle){
return nums2[index2];
}
}else{
if(start == middle - 1){
temp = nums2[index2];
}
if(start == middle){
return ((double)temp + (double)nums2[index2])/2;
}
}
index2++;
}
start ++;
}
return 0.0;
}
最新文章
- NOIP模拟赛20161016R2
- 7.dotnet core 如何发邮件
- Perl/Nagios – Can’t locate utils.pm in @INC
- redis-redigo及redis存储时间问题测试
- 关于PHP程序员解决问题的能力
- Emmet插件详解
- 【一天一道LeetCode】#6 ZigZag Conversion
- windows2012R2安装SQL2005详情！
- java 中异常处理示例并捕获完整异常内容
- python sqlparse 各种 token
- ant 执行java文件，java文件中含中文，显示乱码
- HGOI 20190218 题解
- STM32 CAN
- IIC AT24C02读写数据的一点小体会
- Can't locate find.pl in @INC (@INC contains: /etc/perl xxxx) at perlpath.pl line 7.
- svn: E200009: 'lib/systemd/system/dropbear@.service': a peg revision is not allowed here problem
- 「Ionic」WebStorm的使用錯誤-
- JAXP使用Stax API时格式化输出XML
- Spring属性注入、构造方法注入、工厂注入以及注入参数（转）
- LCS(详解）