(Leet Code JS)Longest Increasing Subsequence

https://leetcode.com/problems/longest-increasing-subsequence/

Longest Increasing Subsequence - LeetCode

 

/**
 * @param {number[]} nums
 * @return {number}
 */
var lengthOfLIS = function(nums) {
    const length = nums.length;
    const dp = Array.from({length}, () => 0);
    let answer = 0;
    
    for(let i = 0; i < length; i++){
        if(dp[i] === 0){
            dp[i] = 1;
        }
        
        for(let j = 0; j < length; j++){
            if(nums[j] < nums[i]){
                if(dp[i] < dp[j] + 1){
                    dp[i] = dp[j] + 1;
                }
            }
        }
        
        answer = Math.max(answer, dp[i]);
    }
    
    return answer;
};