674. Longest Continuous Increasing Subsequence

最新推荐文章于 2022-09-20 20:59:37 发布

且听疯吟

最新推荐文章于 2022-09-20 20:59:37 发布

阅读量423

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/mml1106/article/details/77922240

leetcode 专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一种求解整数数组中最长连续递增子序列长度的算法实现。通过一次遍历，利用两个指针记录起始和结束位置，更新最长序列长度，实现了高效的求解方法。

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

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

int findLengthOfLCIS(int* nums, int numsSize) {
    int count = 0;
    int start = 0;
    int end = 0;
    int i = 0;

    if(nums == NULL || numsSize <= 0){
        return 0;
    }

    if(numsSize == 1) {
        return 1;
    }

    i = 1;
    start = 0;
    end = 0;
    count  = 1;
    while(i < numsSize){
        if(nums[i]>nums[end]){
            end = i;
        }else{
            count = (end-start+1) > count ? (end-start+1):count;
            start = i;
            end = i;
        }
        i++;
    }

    count = (end-start+1) > count ? (end-start+1):count; 

    return count;
}