674.Longest Continuous Increasing Subsequence

Tags: Easy Array

Link: https://leetcode.com/problems/longest-continuous-increasing-subsequence/

---

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. 

---

Answer:

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int maxLength = 1, currentLength = 1;

        if(nums.size() == 0) return 0;
        if(nums.size() == 1) return 1;

        for(int i = 0; i < nums.size()-1; ++i)
        {
            if(nums[i+1] > nums[i]) ++currentLength;
            else currentLength = 1;
            maxLength = max(maxLength,currentLength);
        }

        return maxLength;
    }
};