Naive Approach || 68% TC || 61% S.C || CPP
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int findLengthOfLCIS(vector<int>& nums) {\n        int n=nums.size();\n        int r=1;\n        int maxi=1;\n        int count=1;\n        while(r<n){\n            if(nums[r-1]<nums[r]){\n                count++;\n            }\n            else\n            {\n                maxi=max(count,maxi);\n                count=1;\n            }\n            r++;\n        }\n        maxi=max(count,maxi);\n        return maxi;\n    }\n};\n```
['C++']