674. 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. 

Note: Length of the array will not exceed 10,000.

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        if(nums.size()<=1) return nums.size();
        int current = nums[0];
        int idx=0;
        int num=1;
        int mx = 0;
        for(int i=1; i<nums.size(); i++)
        {
            if(nums[i]>current&&(idx==i-1))
            {
                num++;
            }else
            {
                num = 1;
            }
            idx = i;
            mx = max(num, mx);
            current = nums[i];
        }
        return mx;
    }
};