Easy Java Solution || 1ms & faster than 100%
\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) {\n        int max = 1;\n        int count = 1;\n        \n        for(int i = 1 ; i < nums.leng
```\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) {\n        int max = 1;\n        int count = 1;\n        \n        for(int i = 1 ; i < nums.length; i++) {\n            if (nums[i - 1] < nums[i]) {\n                count++;\n            } else {\n                count = 1;\n            }\n            if (max < count) {\n                max = count;\n            }\n        }\n        return max;\n    }\n}\n```
['Java']