class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
bool flag;
int res=0;
int l=0;
int tmp=1;
for(int i=1;i<nums.size();i++){
if(nums[i]>nums[i-1]){
tmp+=1;
}
else{
l=i;
res=res>tmp?res:tmp;
tmp=1;
}
}
res=res>tmp?res:tmp;
return res;
}
};
LEETCODE 674. 最长连续递增序列
最新推荐文章于 2024-10-01 05:04:32 发布