2019年12月15日
[LC] 674. Longest Continuous Increasing Subsequence
摘要： Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray). Example 1: Input: [1,3,5,4,7] Output: 3 阅读全文
posted @ 2019-12-15 03:23 xuan_abc 阅读(191) 评论(0) 推荐(0)
[LC] 300. Longest Increasing Subsequence
摘要： Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4 Explanation: T 阅读全文
posted @ 2019-12-15 00:41 xuan_abc 阅读(122) 评论(0) 推荐(0)