LeetCode-674. Longest Continuous Increasing Subsequence

LeetCode-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: 3Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4.

Example 2:

Input: [2,2,2,2,2]Output: 1Explanation: The longest continuous increasing subsequence is [2], its length is 1.

Note: Length of the array will not exceed 10,000.

题解：

标准DAG模型：

go：

func findLengthOfLCIS(nums []int) int { if len(nums) < 2 { return len(nums) } res, dp := 1, 1 for i := 1; i < len(nums); i++ { if nums[i] > nums[i - 1] { dp++ if dp > res { res = dp } } else { dp = 1 } } return res}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。