78. Longest Increasing Subsequence
MediumDynamic programming
Return the length of the longest strictly increasing subsequence of nums.
Example 1
Input: nums = [10, 9, 2, 5, 3, 7, 101, 18] Output: 4 Explanation: 2, 3, 7, 101
Constraints
1 ≤ nums.length ≤ 2500