首页 > itarticle > [leetcode] problem 674 – longest continuous increasing subsequence

[leetcode] problem 674 – longest continuous increasing subsequence

admin 11月 13, 2020 0

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

Example

No.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.

No.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.

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
 
public int (int[] nums) {
    if (nums.length == 0)
        return 0;
    
    int result = 1;
    int count = 1;

    for (int i = 1; i < nums.length; i++) {
        if (nums[i] > nums[i - 1]) {
            count++;
            result = Math.max(result, count);
        }
        else
            count = 1;
    }

    return result;
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能