Leetcode 674 Longest Continuous Increasing Subsequence

最新推荐文章于 2021-11-03 13:00:36 发布

哀酱

最新推荐文章于 2021-11-03 13:00:36 发布

阅读量411

点赞数

分类专栏： LeetCode(c++&python) 文章标签： leetcode

本文链接：https://blog.csdn.net/u010821666/article/details/78017759

版权

LeetCode(c++&python) 专栏收录该内容

136 篇文章 0 订阅

订阅专栏

Leetcode 674 Longest Continuous Increasing Subsequence

#include <vector>
using namespace std;
class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
    int maxLength = 1;
    int count = 1;
    int size = nums.size();
    if(nums.empty())
      return 0;
    for(int i = 1;i < size;i ++)
    {
        if(nums[i] > nums[i - 1])
        {
        count ++;
        }
        else
        {
        if(count > maxLength)
        {
            maxLength = count;    
        }
        count = 1;

        }
    }
    return maxLength > count ? maxLength : count;

    }
};