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

代码：

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        double result = 0;
        int size = nums1.length + nums2.length;
        Double[] all = new Double[size];
        for (int i = 0; i < nums1.length; i++) {
            all[i] = Double.valueOf(nums1[i]);
        }
        for (int i = nums1.length; i < size; i++) {
            all[i] = Double.valueOf(nums2[i - nums1.length]);
        }
        Arrays.sort(all);
        if (size % 2 == 1) {
            result = all[size / 2];
            return result;
        } else {
            result = (all[size / 2] + all[size / 2 - 1]) / 2;
            return result;
        }
    }
}