Beats 95% users, simple
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nclass Solution {\npublic:\n    int findLengthOfLCIS(vector<int>& nums) {\n        int count=1;\n        int index=0;\n        int ans=1;\n        for(int i=1;i<nums.size();i++){\n            if(nums[i]>nums[i-1]){\n                count++;\n            }else{\n                ans=max(ans,count);\n                count=1;\n            }\n        }\n        ans=max(ans,count);\n        return ans;\n    }\n};\n```
['C++']