版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/itnerd/article/details/82726129
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
my solution:
class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int len1 = nums1.length;
int len2 = nums2.length;
int totalNum = len1 + len2;
int i = 0, j = 0; // 两个数组的游标
int value1=0, value2=0, currentValue=0; //随便初始化一下
while(true){
if(i == len1){
currentValue = nums2[j++];
}else if(j == len2){
currentValue = nums1[i++];
}else
currentValue = (nums1[i]>nums2[j])?nums2[j++]:nums1[i++];
if(i+j-1 == totalNum/2-1)
value1 = currentValue; //当总数为偶数时需要用到
if(i+j-1 == totalNum/2){
value2 = currentValue; //总数为奇数时的中位数
break;
}
}
return totalNum % 2 == 0?(value1+value2)/2.0:value2;
}
}