Python DP solution
\nclass Solution(object):\n    def findLengthOfLCIS(self, nums):\n        if not nums:\n            return 0\n        dp = [1] * len(nums)\n        for i in ran
```\nclass Solution(object):\n    def findLengthOfLCIS(self, nums):\n        if not nums:\n            return 0\n        dp = [1] * len(nums)\n        for i in range(1, len(nums)):\n            if nums[i] > nums[i-1]:\n                dp[i] = dp[i - 1] + 1\n        return max(dp)\n```
[]