100% Acceptance! ✅
VELAN.MVelan.MComplexity
Time complexity:O(n)

Space complexity:O(n)
Code
# VELAN.M
$$Velan.M$$
# Complexity
- Time complexity:$$O(n)$$ 
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:$$O(n)$$ 
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int n=nums.size(),c=0,maxc=0;
        for(int i=0;i<n-1;i++){
            if(nums[i]<nums[i+1])maxc=max(++c,maxc);
            else c=0;
        }
        return maxc+1;  
    }
};
```
['C++']