LeetCode4 寻找两个正序数组的中位数

1 分析

可以用简单思路去做： 1、把数组合并并排序 2、返回中位数

2 Code

function findMedianSortedArrays(nums1: number[], nums2: number[]): number {
  const num: number[] = [...nums1, ...nums2].sort((a, b) => a - b);

  let res: number;
  if(num.length % 2 !== 0) {
    let mid = (num.length - 1) / 2;
    res =  num[mid];
  }else {
    let midr = num.length / 2;
    let midl = midr - 1;
    res =  (num[midl] + num[midr]) / 2
  }

  return res;
};