Two Simple Python Solutions
\nclass Solution:\n    def findLengthOfLCIS(self, nums: List[int]) -> int:\n        prev, cur, res = 0, 0, 0\n        \n        for n in nums:\n            cur 
```\nclass Solution:\n    def findLengthOfLCIS(self, nums: List[int]) -> int:\n        prev, cur, res = 0, 0, 0\n        \n        for n in nums:\n            cur = cur + 1 if prev < n else 1\n            res = max(res, cur)\n            prev = n\n\n        return res\n\nTime complexity: O(n)\nSpace complexity: O(1)\n```\n\n```\nclass Solution:\n    def findLengthOfLCIS(self, nums: List[int]) -> int:\n        n = len(nums)\n        dp = [1] * n\n        \n        for i in range(1, n):\n            if nums[i] > nums[i-1]:\n                dp[i] = dp[i-1] + dp[i]\n        \n        return max(dp)\n\nTime complexity: O(n)\nSpace complexity: O(n)\n```
[]