LeetCode 4. 寻找两个正序数组的中位数
class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int maxLen = nums1.length + nums2.length;
int[] maxNums = new int[maxLen];
System.arraycopy(nums1, 0, maxNums, 0, nums1.length);
System.arraycopy(nums2, 0, maxNums, nums1.length, nums2.length);
Arrays.sort(maxNums);
if (maxLen % 2 != 0) {
return maxNums[maxLen/2];
}else {
return Double.valueOf((double) (maxNums[maxLen / 2] + maxNums[(maxLen - 1) / 2]) /2);
}
}
}