Longest Increasing Subsequence

Medium

Given an integer array nums, return the length of the longest strictly increasing subsequence.

Example 1

Input:  nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: [2,3,7,101] or [2,3,7,18].

Example 2

Input:  nums = [0,1,0,3,2,3]
Output: 4

Constraints

• 1 <= nums.length <= 2500
• -10^4 <= nums[i] <= 10^4