674 Longest Continuous Increasing Subsequence

最新推荐文章于 2024-09-28 18:22:46 发布

hareyukai

最新推荐文章于 2024-09-28 18:22:46 发布

阅读量143

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode Java

本文链接：https://blog.youkuaiyun.com/guothin/article/details/80023095

LeetCode 同时被 2 个专栏收录

13 篇文章

订阅专栏

Java

12 篇文章

订阅专栏

本文介绍了一种算法，用于查找未排序整数数组中最长连续递增子序列的长度。通过示例展示了如何使用该算法解决问题，并提供了一个简洁的Java实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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.

class Solution {
  public int findLengthOfLCIS(int[] nums) {
    if (nums.length < 1) { return 0; }
    else if (nums.length < 2) { return 1; }
    int result = 0;
    int tmp = 1;
    for (int i = 1; i < nums.length; i++) {
      tmp = nums[i - 1] < nums[i] ? tmp + 1 : 1;
      result = tmp > result ? tmp : result;
    }
    return result;
  }
}