版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/83280840
https://leetcode.com/problems/longest-continuous-increasing-subsequence/description/
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int n = nums.size();
if(n<=1) return n;
int res = 1, len=1;
for(int i=1; i<n; i++){
if(nums[i] > nums[i-1]) len+=1;
else len = 1;
res = max(len, res);//进行比较
}
return res;
}
};