寻找两个正序数组的中位数java

Question

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int i = 0, j = 0, k = 0;
        int n = nums1.length;
        int m = nums2.length;
        int t = m + n;
        int temp[] = new int[t];
        while (i < n && j < m) {
            if (nums1[i] >= nums2[j]) {
                temp[k++] = nums1[i++];
            } else {
                temp[k++] = nums2[j++];
            }
        }

        while (i < n) {
            temp[k++] = nums1[i++];
        }

        while (j < m) {
            temp[k++] = nums2[j++];
        }

        int len = m + n;
        double mid;

        int middle;
        if (len % 2 == 0) {
            middle = len / 2;
            mid = (temp[middle - 1] + temp[middle]) / 2.0;
        } else {
            middle = len / 2;
            mid = temp[middle - 1];
        }
        return mid;
    }
}

力扣上的一道小题，不知道为啥会这样，我认为逻辑没错误

Answer 1

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int i = 0, j = 0, k = 0;
        int n = nums1.length;
        int m = nums2.length;
        int t = m + n;
        int temp[] = new int[t];
        while (i < n && j < m) {
             if (nums1[i] <= nums2[j]) {
             //if (nums1[i] >= nums2[j]) {
                temp[k++] = nums1[i++];
            } else {
                temp[k++] = nums2[j++];
            }
        }
        while (i < n) {
            temp[k++] = nums1[i++];
        }
        while (j < m) {
            temp[k++] = nums2[j++];
        }
        int len = m + n;
        double mid;
        int middle;
        if (len % 2 == 0) {
            middle = len / 2;
            mid = (temp[middle - 1] + temp[middle]) / 2.0;
        } else {
            middle = len / 2;
            mid = temp[middle];
            //mid = temp[middle - 1];
        }
        return mid;
    }
}