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}
*/
var findMedianSortedArrays = function(nums1, nums2) {
var sNums1=nums1;
var sNums2=nums2;
var nums = (sNums1.concat(sNums2))
nums=nums.sort(function(i,j){
return i-j;
});
var n=nums.length;
if(n%2==0){
return (nums[n/2-1]+nums[n/2])/2;
}else{
var index=Math.floor(n/2);
return nums[index]
}
};