04.寻找两个正序数组的中位数

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int m = nums1.length, n = nums2.length;
        if (m == 0) {
            return getMid(nums2);
        }
        if (n == 0) {
            return getMid(nums1);
        }
        int[] temp = new int[m + n];
        int i = 0, j = 0, count = 0;
        while (count != (m + n)) {
            if (i == m) {
                while (j != n) {
                    temp[count++] = nums2[j++];
                }
                break;
            }
            if (j == n) {
                while (i != m) {
                    temp[count++] = nums1[i++];
                }
                break;
            }
            if (nums1[i] < nums2[j]) {
                temp[count++] = nums1[i++];
            } else {
                temp[count++] = nums2[j++];
            }
        }
        return getMid(temp);
    }

    public double getMid(int[] nums) {
        if (nums.length % 2 == 0) {
            return (nums[nums.length / 2] + nums[nums.length / 2 - 1]) / 2.0;
        } else {
            return nums[nums.length / 2];
        }
    }
}