C++ || Greed is best || Easy to understand
Runtime: 24 ms, faster than 54.02% of C++ online submissions for Longest Continuous Increasing Subsequence.\nMemory Usage: 11 MB, less than 94.51% of C++ online
***Runtime: 24 ms, faster than 54.02% of C++ online submissions for Longest Continuous Increasing Subsequence.\nMemory Usage: 11 MB, less than 94.51% of C++ online submissions for Longest Continuous Increasing Subsequence.***\n```\nclass Solution {\npublic:\n    int findLengthOfLCIS(vector<int>& nums) {\n        int n = nums.size();\n        if(n == 0)    \n            return 0;\n        int result = 1;\n        int current = 1;\n        for(int i=1;i<n;i++){\n            if(nums[i] > nums[i-1]){\n                current++;\n            }else{\n                current = 1;\n            }\n            result = max(result, current);\n        }\n        return result;\n    }\n};\n```
['C', 'C++']