两个递增数组（链表）合并

两个递增链表合并

const mergeTwoLists = (l1, l2) => {
    
    
    const res = new ListNode(0);
    let p = res;
    while (l1 && l2) {
    
    
        if (l1.val < l2.val) {
    
    
            p.next = l1;
            l1 = l1.next;
        } else {
    
    
            p.next = l2;
            l2 = l2.next;
        }
        p = p.next;
    }
    p.next = l1 ? l1 : l2;
    return res.next;
};

两个递增的数组合并

function f(arr, brr) {
    
    
  var res = []
  while (arr.length && brr.length) {
    
    
    if (arr[0] > brr[0]) {
    
    
      res.push(brr[0])
      brr.shift()
    } else {
    
    
      res.push(arr[0])
      arr.shift()
    }
  }
  return arr.length ? res.concat(arr) : res.concat(brr)
}
console.log(f([1, 1, 3, 6], [1, 3, 5, 8, 9]))// [1, 1, 1, 3, 3, 5, 6, 8, 9]