beats 100% and easy solution in c++.
IntuitionApproachComplexity
Time complexity:O(n)

Space complexity:O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

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

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

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