4 - 寻找两个正序数组的中位数 about leetcode HOT 2 OPEN

const findMedianSortedArrays = (num1: number[], num2: number[]): number => {
  const res: number[] = [];
  let i = 0;
  let j = 0;
  while (i < num1.length && j < num2.length) {
    if (num1[i] < num2[j]) {
      res.push(num1[i]);
      i++;
    } else {
      res.push(num2[j]);
      j++;
    }
  }
  while (i < num1.length) {
    res.push(num1[i]);
    i++;
  }
  while (j < num2.length) {
    res.push(num2[j]);
    j++;
  }
  const len = res.length;
  if (len % 2 === 0) {
    return (res[len / 2] + res[len / 2 - 1]) / 2;
  } else {
    return res[(len - 1) / 2];
  }
};

console.log(findMedianSortedArrays([2], [3])); // 2.5