Java | 100% faster | simple - O(n) time and O(1) space - simple and only few lines
\npublic int findLengthOfLCIS(int[] nums) \n{\n\tint maximum = 1;\n\tint currentMax = 1;\n\tfor(int i = 1; i < nums.length; i++)\n\t{\n\t\tcurrentMax = nums[i] 
```\npublic int findLengthOfLCIS(int[] nums) \n{\n\tint maximum = 1;\n\tint currentMax = 1;\n\tfor(int i = 1; i < nums.length; i++)\n\t{\n\t\tcurrentMax = nums[i] > nums[i - 1] ? currentMax + 1 : 1;   \n\t\tmaximum = Math.max(maximum, currentMax);\n\t}\n\n\treturn nums.length == 0 ? 0 : maximum;\n}\n```
['Java']