O(n) Longest Continuous Increasing Subsequence Solution in C++
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 i, len=1, maxlen=1;\n        for(i=1 ; i<nums.size() ; i++)\n        {\n            if(nums[i]>nums[i-1])\n            {\n                len++;\n            }\n            else if(len>maxlen)\n            {\n                maxlen = len;\n                len=1;\n            }\n            else\n            {\n                len=1;\n            }\n        }\n        if(len>maxlen)\n            maxlen = len;\n        return maxlen;\n    }\n};\n```\n![upvote new.jpg](https://assets.leetcode.com/users/images/db35f119-6d56-413c-aeac-389431744144_1684034399.839135.jpeg)\n
['C++']