Given a list of numbers nums, find the longest subsequence whose numbers get bigger all the way. A subsequence keeps the original order but may skip some numbers. "Bigger all the way" means each number is strictly greater than the one before it.
Return the length of that longest subsequence.
Examples
Example 1:
Input: nums = [3,10,2,1,20]
Output: 3
Explanation: One longest choice is 3, 10, 20. Its length is 3.
Example 2:
Input: nums = [5,4,3,2]
Output: 1
Explanation: The numbers only go down, so the best you can do is one number.
Example 3:
Input: nums = [1,3,2,4,3,5]
Output: 4
Explanation: One longest choice is 1, 3, 4, 5. Its length is 4.