Java, O(N) time, O(1) space, beat 99.8%
```\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) {\n        int index = 0;\n        int ans = 1;\n        while(index < nums.length) {\n      
```\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) {\n        int index = 0;\n        int ans = 1;\n        while(index < nums.length) {\n            int base = index;\n            while(index < nums.length-1 && nums[index] < nums[index+1]) index++;\n            if(index == base) {\n                index++;\n                continue;\n            }\n            \n            ans = Math.max(ans, index - base + 1);\n        }\n        \n        return ans;\n    }\n}
[]