Simple Java beats 100%
```\n    public int findLengthOfLCIS(int[] nums) {\n        if(nums==null || nums.length ==0)\n            return 0;\n        int count = 1;\n        int max = 
```\n    public int findLengthOfLCIS(int[] nums) {\n        if(nums==null || nums.length ==0)\n            return 0;\n        int count = 1;\n        int max = 0;\n        for(int i =1;i<nums.length;i++){\n            if(nums[i]>nums[i-1]){\n                count++;\n            }else{\n                max = Math.max(max,count);\n                count=1;\n            }\n        }\n        \n        return Math.max(max,count); // if the complete sequence is monotonically increasing
[]