https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence/
思路:我的做法有点类似于滑动窗口。首先规定窗口的左边界
l
l
l,然后让右边界从此开始扩展直到不满足题意为止,那么我们就得到了一个满足题意的区间
[
l
,
r
]
[l,r]
[l,r],更新答案再令
l
=
r
=
r
+
1
l=r=r+1
l=r=r+1继续滑动即可,当右边界
r
>
=
n
r>=n
r>=n时退出循环。
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int l=0,r=0,ans=0,n=nums.size();
while(r<n)
{
while(r+1<n&&nums[r]<nums[r+1])
++r;
ans=max(ans,r-l+1);
l=++r;
}
return ans;
}
};