代码实现
class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int length1 = nums1.length;
int length2 = nums2.length;
int lengthAll = length1 + length2;
int[] arrays = new int[lengthAll];
int i = 0, j = 0, k = 0;
while (i < length1 && j < length2) {
if (nums1[i] < nums2[j]) {
arrays[k++] = nums1[i++];
}else {
arrays[k++] = nums2[j++];
}
}
if (i < length1) {
while (i < length1) {
arrays[k++] = nums1[i++];
}
}
if (j < length2) {
while (j < length2) {
arrays[k++] = nums2[j++];
}
}
if (lengthAll % 2 ==1) {
return arrays[lengthAll / 2];
}else {
return (arrays[lengthAll / 2] + arrays[lengthAll / 2 - 1]) / 2.0;
}
}
}