Question

How to find the longest increasing subsequence (LIS) of a sequence of numbers in TypeScript

Answer 1

function longestIncreasingSubsequence(nums: number[]): number {
  const length: number[] = Array(nums.length).fill(1);
  let maxLength: number = 1;

  for (let i: number = 1; i < nums.length; i++) {
    for (let j: number = 0; j < i; j++) {
      if (nums[i] > nums[j]) {
        length[i] = Math.max(length[i], length[j] + 1);
      }
    }
    maxLength = Math.max(maxLength, length[i]);
  }

  return maxLength;
}

const nums: number[] = [4, 5, 1, 10, 3, 9, 18, 19];
console.log(`Length of LIS: ${longestIncreasingSubsequence(nums)}`);



/*
run:
 
"Length of LIS: 5" 

*/

 

70+ SQL courses for beginners and professionals