数组算法 4

/**
 * 
 * There are two sorted arrays nums1 and nums2 of size m and n respectively.

 * Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

 * Example 1:
 * nums1 = [1, 3]
 * nums2 = [2]

 * The median is 2.0
 * Example 2:
 * nums1 = [1, 2]
 * nums2 = [3, 4]

 * The median is (2 + 3)/2 = 2.5
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number}
 */
function findMedianSortedArrays(nums1, nums2) {
  newNumber = nums1.concat(nums2);

  newNumber.sort(( a, b )=> a - b );

  if( newNumber.length % 2 === 0 ){
    return ( newNumber[ newNumber.length / 2 - 1 ] + newNumber[ newNumber.length / 2 ] ) / 2
  }else{
    return newNumber[ Math.ceil( newNumber.length / 2 ) - 1 ]
  }
}