/**
* @param {number[]} nums1
* @param {number[]} nums2
* @return {number}
*/
var findMedianSortedArrays = function(nums1, nums2) {
//构造新的数组
let mynum = []
let i = 0, j = 0,temp = 0
for(;i < nums1.length; i++){
if(j == nums2.length){
break
}
if(nums1[i] >= nums2[j]){
mynum[temp] = nums2[j]
j = j + 1
i = i - 1
temp = temp + 1
}else{
mynum[temp] = nums1[i]
temp = temp + 1
}
}
if(i == nums1.length){
//i结束了j还不一定。。
for(; j < nums2.length; j++){
mynum[temp] = nums2[j]
temp++
}
return mynum.length%2 == 0?((mynum[mynum.length/2 - 1] + mynum[mynum.length/2])/2):mynum[(mynum.length + 1)/2 - 1]
}else{
//i没结束肯定是跳出来的所以弄i就行
for(; i < nums1.length; i++){
mynum[temp] = nums1[i]
temp++
}
return mynum.length%2 == 0?((mynum[mynum.length/2 - 1] + mynum[mynum.length/2])/2):mynum[(mynum.length + 1)/2 - 1]
}
};
寻找两个正序数组中位数
最新推荐文章于 2023-06-22 14:22:50 发布