Longest Increasing Subsequence
Examples
Example 1:
Input: nums = [9,1,4,2,3,3,7]
Output: 4
Explanation:
Example 2:
Input: nums = [0,3,1,3,2,3]
Output: 4
1-D Dynamic Programming
Example 1:
Input: nums = [9,1,4,2,3,3,7]
Output: 4
Explanation:
Example 2:
Input: nums = [0,3,1,3,2,3]
Output: 4
Given an integer array nums, return the length of the longest strictly increasing subsequence.
A subsequence is a sequence that can be derived from the given sequence by deleting some or no elements without changing the relative order of the remaining characters.
"cat" is a subsequence of "crabt".The longest increasing subsequence is [1,2,3,7], which has a length of 4.
1 <= nums.length <= 1000-1000 <= nums[i] <= 1000