class Solution {
public int findLengthOfLCIS(int[] nums) {
if (nums.length <= 1)
return nums.length;
int ans = 1, count = 1;
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] < nums[i + 1]) {
count++;
}
else {
count = 1;
}
ans = count > ans ? count : ans;
}
return ans;
}
}
leetcode674. 最长连续递增序列
最新推荐文章于 2024-03-30 16:30:32 发布