Clean 0ms Java Solution
\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) \n    {\n        int max =0;\n        int count =0;\n        \n        for(int i=1; i<nums.lengt
```\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) \n    {\n        int max =0;\n        int count =0;\n        \n        for(int i=1; i<nums.length;i++)\n        {\n            if(nums[i-1] < nums[i])\n            {\n                count++;\n                max = Math.max(count , max);\n            }\n            else\n                count =0;\n        }\n        return max+1;\n    }\n}\n```
['Java']