Longest Continuous Increasing Subsequence(最长递增连续子序列)
题目:Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).给定一个无序的整型数组,找到最长的连续递增子序列。例1:输入:[1,3,5,4,7]输出:3例2:输入:[2,2,2,2,2]输出:1解法:时间复杂度O(N)Every (co...
原创
2018-03-07 20:25:06 ·
303 阅读 ·
0 评论