Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
The overall run time complexity should be O(log (m+n))
Example 1:
Input: nums1 = [1,3], nums2 = [2]
Output: 2.00000
Explanation: merged array = [1,2,3] and median is 2.
Example 2:
Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.50000
Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
Constraints:
nums1.length == m
nums2.length == n
0 <= m <= 1000
0 <= n <= 1000
1 <= m + n <= 2000
-106 <= nums1[i], nums2[i] <= 106
var findMedianSortedArrays = function(nums1, nums2) {
const toltalLength = nums1.length + nums2.length;let x = 0;
let y = 0;
const mergedArr = []
for(let i=0; i< toltalLength;i++){
if(x> nums1.length -1){ nums2.splice(0, y)
mergedArr.push(...nums2)
break; }
if(y> nums2.length -1){
nums1.splice(0, x)
mergedArr.push(...nums1)
break;
}
if(nums1[x] > nums2[y]){
mergedArr.push(nums2[y]);
y++;
continue;
}else{
mergedArr.push(nums1[x]);
x++;
continue;
}
}
if(toltalLength % 2 === 0){
return (mergedArr[toltalLength/2] + mergedArr[toltalLength/2 -1]) /2
}else{
return mergedArr[(toltalLength-1)/2]
}
};
Top comments (0)