class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int length1 = nums1.length;
int length2 = nums2.length;
int length = length1 + length2;
int[] is = new int[length];
int index1 = 0, index2 = 0, index = 0;
while (index1 < length1 && index2 < length2) {
if (nums1[index1] < nums2[index2]) {
is[index++] = nums1[index1++];
} else {
is[index++] = nums2[index2++];
}
}
while (index1 == length1 && index2 < length2) {
is[index++] = nums2[index2++];
}
while (index1 < length1 && index2 == length2) {
is[index++] = nums1[index1++];
}
return length % 2 == 0 ? (is[length / 2] + is[length / 2 - 1]) / 2.0 : is[length / 2];
}
}
image.png
