Description
Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is derived by deleting some or no elements without changing order.
Examples
Input:
nums = [10,9,2,5,3,7,101,18]Output:
4Explanation:
The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
Input:
nums = [0,1,0,3,2,3]Output:
4Explanation:
The longest increasing subsequence is [0,1,2,3].
Input:
nums = [7,7,7,7,7,7,7]Output:
1Explanation:
All elements are the same.
Constraints
- •
1 ≤ nums.length ≤ 2500 - •
-10⁴ ≤ nums[i] ≤ 10⁴