js 数组递增最长子序列

// js数组最长递增子序列
function findLongestIncreasingSubsequence(nums) {
  if (nums.length === 0) {
    return;
  }
  // 记录数据
  let result = [[nums[0]]];
  function _modifyArray(val) {
    for (let i = result.length - 1; i >= 0; i--) {
      if (result[i][result[i].length - 1] < val) {
        result[i + 1] = [...result[i], val]; // 找到比val小的子数组，在后面添加val
      }
    }
    result[0] = [val];
  }
  for (let i = 1; i < nums.length; i++) {
    _modifyArray(nums[i]);
  }
  return result[result.length - 1];
}

console.log(findLongestIncreasingSubsequence([123, 21, 31, 4, 5, 6, 7, 8, 9]));