Solution
C++ []\nclass Solution {\npublic:\n    int findLengthOfLCIS(vector<int>& nums) {\n        int maxlength = 1;\n        int length = 1;\n        int n = nums.size
```C++ []\nclass Solution {\npublic:\n    int findLengthOfLCIS(vector<int>& nums) {\n        int maxlength = 1;\n        int length = 1;\n        int n = nums.size();\n        for(int i= 1; i<n;i++){\n            if (nums[i-1]<nums[i]){\n                length++;\n            }\n            else{\n                if(maxlength<length){\n                    maxlength = length;\n                }\n                length = 1;\n            }\n        }\n        return max(length, maxlength);\n    }\n};\n```\n\n```Python3 []\nclass Solution:\n    def findLengthOfLCIS(self, nums: List[int]) -> int:\n        l, r, curMax = 0, 1, 1\n        while r < len(nums):\n            if nums[r] > nums[r-1]:\n                curMax = max(curMax, r-l+1)\n            else:\n                l = r\n            r += 1\n        return curMax\n```\n\n```Java []\nclass Solution {\n    public int findLengthOfLCIS(int[] nums) \n    {\n        int maxCount = 1;\n        int currentCount = 1;\n        int i = 0 ;\n        int j = 1;\n        while(j<nums.length)\n        {\n            if(nums[j]>nums[i])\n            {\n                currentCount++;\n                i++;\n                j++;\n            }\n            else\n            {\n                i = j;\n                j++;\n                currentCount = 1;\n            }\n            if(maxCount<currentCount)\n            {\n                maxCount = currentCount;\n            }\n        }  \n        return maxCount;  \n    }\n}\n```\n
['C++', 'Java', 'Python3']