力扣4-寻找两个正序数组的中位数

    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int numl1 = nums1.length;
        int numl2 = nums2.length;
        double[] result = new double[numl1 + numl2];
        for (int i = 0; i < numl1; i++) {
            result[i] = nums1[i];
        }
        for (int i = 0; i < numl2; numl1++) {
            result[numl1] = nums2[i];
            i++;
        }
        Arrays.sort(result);
        if (result.length % 2 == 0) return (result[result.length / 2] + result[result.length / 2 - 1]) / 2;
        return result[result.length / 2];

    }