674. Longest Continuous Increasing Subsequence

int findLengthOfLCIS(vector<int>& nums) {
if(nums.empty()) return 0;
int res=0,n=nums.size(),ma=0;
for(int i=0;i<n-1;i++){
if(nums[i]<nums[i+1])
res++;
else{
ma=max(res,ma);
res=0;
}
}
ma=max(res,ma);
return ma+1;
}

int findLengthOfLCIS(vector<int>& nums) {
int num=0,cnr=INT_MAX,res=0;
for(auto a:nums){
if(a>cnr) num++;
else num=1;
res=max(res,num);
cnr=a;
}
return res;
}

int findLengthOfLCIS(vector<int>& nums) {
int res=0,n=nums.size(),cnt=0;
for(int i=0;i<n;i++){
if(i==0||nums[i-1]<nums[i]) res=max(res,++cnt);
else cnt=1;
}
return res;
}