最长递增子序列

https://www.douyin.com/user/self?modal_id=7332377484912119040&showTab=favorite_collection

function lis(nums) {
  if (nums.length === 0) return 0;
  const results = [[nums[0]]];
  for (let i = 1; i < nums.length; i++) {
    const n = nums[i];
    _update(n);
  }
  function _update(n) {
    for (let i = results.length - 1; i >= 0; i--) {
      const line = results[i];
      const tail = line[line.length - 1];
      if (n > tail) {
        results[i + 1] = [...line, n];
        break;
      } else if (n < tail && i === 0) {
        results[i] = [n];
        break;
      }
    }
  }
  console.log(results);
  return results[results.length - 1];
}
console.log(lis([4, 5, 1, 2, 7, 3, 6, 9]));