Longest Increasing Subsequence
Medium
LC #300
best ending herebinary search1d dpNot attempted yet
Return the length of the longest strictly increasing
subsequence of nums. A subsequence keeps the original
order but may skip elements.
Example 1
Input: nums = [10, 9, 2, 5, 3, 7, 101, 18]
Output: 4
e.g. [2, 3, 7, 101]
Example 2
Input: nums = [0, 1, 0, 3, 2, 3]
Output: 4
Example 3
Input: nums = [7, 7, 7, 7, 7, 7, 7]
Output: 1
Constraints
- 1 ≤ len(nums) ≤ 2500
- -10⁴ ≤ nums[i] ≤ 10⁴