难度:简单。
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int n = nums.size();
if(n <= 1)return n;
int result = 0;
int i = 0;
while(i < n){
int j = i + 1, k = 1;
for(; j < n; j++){
if(nums[j] > nums[j - 1]){
k++;
}
else{
break;
}
}
if(k > result)result = k;
i = j;
}
return result;
}
};