dp is powerfull
\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) {\n        if(nums.length == 0) return 0;\n        int[] dp = new int[nums.length];\n        dp[
```\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) {\n        if(nums.length == 0) return 0;\n        int[] dp = new int[nums.length];\n        dp[0] = 1;\n        for(int i = 1;i < nums.length;++i) {\n            if(nums[i] > nums[i - 1]) {\n                dp[i] = dp[i - 1] + 1;\n            } else {\n                dp[i] = 1;\n            }\n        }\n        int max = Integer.MIN_VALUE;\n        for(int i = 0;i < nums.length;++i) {\n            if(dp[i] > max) {\n                max = dp[i];\n            }\n        }\n        return max;\n    }\n}\n\n```
[]