674. Longest Continuous Increasing Subsequence

最新推荐文章于 2024-03-20 13:53:30 发布

转载最新推荐文章于 2024-03-20 13:53:30 发布 · 53 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/wzj4858/p/7672664.html

本文介绍了一种求解给定整数数组中最长连续递增子序列长度的方法。通过一次遍历，利用双指针技巧高效找出最长递增序列，并提供了一个具体的Java实现示例。

Given an unsorted array of integers, find the length of longest continuous increasing subsequence.

Example 1:

Input: [1,3,5,4,7]
Output: 3
Explanation: 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: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1.

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

获取给定数组的最长递增子串长度

解法一：

 1     public int findLengthOfLCIS(int[] nums) {
 2         int max=0,left=0;
 3         if (nums.length==0) return 0;
 4         while (left<nums.length)
 5         {
 6             int count=1;
 7             int right = left+1;
 8             while (right<nums.length && nums[left] < nums[right])
 9             {
10                 count++;
11                 left=right;
12                 right++;
13             }
14             left=right;
15             max = Math.max(max,count);
16         }
17         return max;
18     }