Easy solution using C++ |100% beats
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```cpp []\nclass Solution {\npublic:\n    int findLengthOfLCIS(vector<int>& nums) {\n        int c=1;\n        int n=nums.size();\n        int maxm=1;\n        for (int i=0;i<n-1;i++){\n            if (nums[i]<nums[i+1]){\n                c++;\n            } else{\n                c=1;\n            }\n            maxm=max(maxm,c);\n        }\n        return maxm;\n    }\n};\n```
['C++']