Two python solutions using dp and a straightforward soln
DP solution.\nclass Solution:\n    def findLengthOfLCIS(self, nums: List[int]) -> int:\n        dp=[1]*len(nums)\n        for i in range(1,len(nums)):\n        
1. DP solution.\n```class Solution:\n    def findLengthOfLCIS(self, nums: List[int]) -> int:\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]\n        return max(dp)\n ```\n2\n```\nclass Solution:\n    def findLengthOfLCIS(self, nums: List[int]) -> int:\n        counter=1\n        temp=1\n        for i in range(0,len(nums)-1):\n            if nums[i]<nums[i+1]:\n                temp+=1\n                if temp>counter:\n                    counter=temp\n            else:\n                temp=1\n        return counter
['Python', 'Python3']