Longest Increasing Subsequence
MediumP1Coding
Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence keeps the original order but may skip elements.
Example 1
- Input
- nums = [10,9,2,5,3,7,101,18]
- Output
- 4
- Why
- One longest subsequence is [2,3,7,101].
Example 2
- Input
- nums = [0,1,0,3,2,3]
- Output
- 4
Example 3
- Input
- nums = [7,7,7,7]
- Output
- 1
Constraints
- 1 <= nums.length <= 2500
- -10^4 <= nums[i] <= 10^4
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 10. ⌘Enter runs, ⌘⇧Enter submits.