674. Longest Continuous Increasing Subsequence
Intuition\n Describe your first thoughts on how to solve this problem. \nSo it is so simple naive approach which make you so clear and understand\n# Approach\n 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nSo it is so simple naive approach which make you so clear and understand\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)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int findLengthOfLCIS(vector<int>& nums) {\n        int n=nums.size();\n        int count=1, maxcount=1;\n        for(int i=1; i<n; i++){\n         if(nums[i]>nums[i-1]){\n         count++;\n         }\n         else{\n            count=1;\n         }\n       maxcount=max(count,maxcount);\n    }\n        return maxcount;\n    }\n};\n```
['C++']