
给定两个大小分别为 m 和 n 的排序数组 nums1 和 nums2,返回这两个排序数组的中位数。
整体运行时间复杂度应为 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.
限制:
nums1.length == m
nums2.length == n
0 <=米 <=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]
}
};
以上就是Median of Two Sorted Arrays的详细内容,更多请关注php中文网其它相关文章!
每个人都需要一台速度更快、更稳定的 PC。随着时间的推移,垃圾文件、旧注册表数据和不必要的后台进程会占用资源并降低性能。幸运的是,许多工具可以让 Windows 保持平稳运行。
Copyright 2014-2025 https://www.php.cn/ All Rights Reserved | php.cn | 湘ICP备2023035733号