QuestionGiven an integer arraynums, returnthe length of the longeststrictly increasingsubsequence**.Example 1:Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.Example 2:Input: nums = [0,1,0,3,2,3]
Output: 4Example 3:Input: nums = [7,7,7,7,7,7,7]
Output: 1Constraints:1 <= nums.length <= 2500-104 <= nums[i] <= 104ApproachUse dp, define dp[i] as the ith element, that so far it can be longest subsequence.The status transform equation is if the element nums[i] is larger than the previous element nums[j], thendp[i
...
继续阅读
(44)