300 Longest Increasing Subsequence
https://leetcode.com/problems/longest-increasing-subsequence/
solution
dp
时间复杂度:O(n^2) 空间复杂度:O(n)
binary search
时间复杂度:O(nlog(n)) 空间复杂度:O(n)
follow up
674 Longest Continuous Increasing Subsequence
最长连续递增序列,由于要求必须连续,因此只需要dp(i)与dp(i-1)比较即可
646. Maximum Length of Pair Chain
Last updated