Given an integer array nums, return the length of the longest strictly increasing subsequence. For example for the array [1,2,4,6,3,4,5] the Longest Increasing Subsequence will be [1,2,3,4,5] with size of 5.
Problem at Leetcode.
Given an integer array nums, return the length of the longest strictly increasing subsequence. For example for the array [1,2,4,6,3,4,5] the Longest Increasing Subsequence will be [1,2,3,4,5] with size of 5.
Problem at Leetcode.