首页 > itarticle > 674. longest continuous increasing subsequence

674. longest continuous increasing subsequence

admin 11月 16, 2020 0

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

Example 1:

1
2
3
4
 
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:

1
2
3
 
Input: [2,2,2,2,2]
Output: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1.
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
 
class  {
    public int findLengthOfLCIS(int[] nums) {
        if (nums.length < 2) return nums.length;
     int count = 1;
      int max = 1;
        for (int i = 1; i < nums.length; i++) {
         if (nums[i - 1] < nums[i]) {
             count++;
         } else {
                max = Math.max(count, max);
              count = 1;
           }
        }
        return Math.max(count, max);
    }
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能