Longest Increasing Subsequence LeetCode solution in JavaScript

1
var lengthOfLIS = function (nums) {
2
  let len = nums.length;
3
  let dp = Array.from({ length: len }, (v) => 1);
4

5
  for (let i = 1; i < len; i++) {
6
    for (let j = 0; j < i; j++) {
7
      if (nums[i] > nums[j] && dp[i] <= dp[j]) {
8
        dp[i] = dp[j] + 1;
9
      }
10
    }
11
  }
12

13
  return Math.max(...dp);
14
};