代码:
function findMedianSortedArrays(nums1, nums2) {
let newArr = [...nums1, ...nums2];
newArr.sort((a, b) => {
return a - b;
});
let medianNum = Math.floor(newArr.length / 2);
let medianRemainder = newArr.length % 2;
if (medianRemainder === 0) {
return (newArr[medianNum - 1] + newArr[medianNum]) / 2;
} else {
return newArr[medianNum];
}
}