python3 stack fast easy solution
\nclass Solution:\n    def findLengthOfLCIS(self, nums: List[int]) -> int:\n        stack = [nums[0]]\n        ret = 1\n        for i in range(1, len(nums)):\n 
```\nclass Solution:\n    def findLengthOfLCIS(self, nums: List[int]) -> int:\n        stack = [nums[0]]\n        ret = 1\n        for i in range(1, len(nums)):\n            if stack and stack[-1] >= nums[i]: stack.clear()\n            stack.append(nums[i])\n            ret = max(ret, len(stack))\n        return ret\n```
['Stack', 'Python', 'Python3']