There are two sorted arrays nums1 and nums2 of size m and n respectively.
1578 ワード
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)).
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
class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int i = 0;
int j = 0;
int allLength = nums1.length + nums2.length;
int data[] = new int[allLength];
int index = 0;
while (i < nums1.length && j < nums2.length) {
if (nums1[i] < nums2[j]) {
data[index++] = nums1[i++];
} else {
if (nums1[i] > nums2[j]) {
data[index++] = nums2[j++];
} else {
data[index++] = nums1[i++];
data[index++] = nums2[j++];
}
}
}
while (i < nums1.length) {
data[index++] = nums1[i++];
}
while (j < nums2.length) {
data[index++] = nums2[j++];
}
if (allLength % 2 != 0) {
return data[allLength/2];
} else {
int middleIndex = allLength/2;
return (data[middleIndex - 1] + data[middleIndex]) * 1.0/2;
}
}
}