leetcode 674. Longest Continuous Increasing Subsequence

原题:

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.


总感觉这个题目做过一遍呵。。。

代码如下:

int findLengthOfLCIS(int* nums, int numsSize) {
    if(numsSize==0)
        return 0;
    int max=0;
    int temp=1;
    for(int n=1;n<numsSize;n++)
    {
        if(*(nums+n)>*(nums+n-1))
        {
            temp++;
        }
        else
        {
            if(temp>max)
                max=temp;
            temp=1;
        }
    }
    if(temp>max)
        return temp;
    return max;
}

遍历一遍就好。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值