Given an integer array nums, return the length of the longest strictly increasing subsequence. This problem is commonly introduced as a DP state optimization challenge.
nums = array of integers
length of the longest strictly increasing subsequence
Example 1:
Input:
nums = [10,9,2,5,3,7,101,18]
Output:
4
Explanation:
One LIS is [2,3,7,101].
Example 2:
Input:
nums = [0,1,0,3,2,3]
Output:
4
Explanation:
One LIS is [0,1,2,3].