Java solution, DP
\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) {\n        if (nums == null || nums.length == 0) return 0;\n        int n = nums.length;\n      
```\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) {\n        if (nums == null || nums.length == 0) return 0;\n        int n = nums.length;\n        int[] dp = new int[n];\n        \n        int max = 1;\n        dp[0] = 1;\n        for (int i = 1; i < n; i++) {\n            if (nums[i] > nums[i - 1]) {\n                dp[i] = dp[i - 1] + 1;\n            }\n            else {\n                dp[i] = 1;\n            }\n            max = Math.max(max, dp[i]);\n        }\n        \n        return max;\n    }\n}\n```
[]