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

 

import java.util.Arrays;

public class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2)  {
        int[] mergedArr = Arrays.copyOf(nums1, nums1.length + nums2.length);
        System.arraycopy(nums2, 0, mergedArr, nums1.length, nums2.length);
        Arrays.sort(mergedArr);
        int num=mergedArr.length;
        if (num%2!=0){
            return mergedArr[(num-1)/2] ;
        }else{
            double i,x;
            i=(mergedArr[(num-1)/2]+mergedArr[num/2]);
            x=i/2;
            return x;
        }
    }
    public static void main(String[] args) {
        int[] nums1 = {1, 4, 2};
        int[] nums2 = {3, 6, 5};
        Solution solution = new Solution();
        double median = solution.findMedianSortedArrays(nums1,nums2);
        System.out.println(median);
    }
}

这里方便测试所以加了主方法，实际提交的时候就不要带着了