Beats 100 % || Easy solution || Java
IntuitionApproachComplexity
Time complexity:

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

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

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

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

# Code
```java []
class Solution {
    public int findLengthOfLCIS(int[] nums) {
        if(nums.length==1) {
            return 1;
        }
        int count=1;
        int max=1;
        for(int i=0;i<nums.length-1;i++) {
            if(nums[i]<nums[i+1]) {
                count++;
            } else {
                max=Math.max(count,max);
                count=1;
            }
        }
        max=Math.max(count,max);
        return max;
    }
}
```
['Java']