题目
674. 最长连续递增序列 - 力扣(LeetCode)
Python
class Solution:
def findLengthOfLCIS(self, nums: List[int]) -> int:
le=len(nums)
if le<=1:
return le
ans=0
record=1
for i in range(le-1):
if nums[i]<nums[i+1]:
record+=1
else:
record=1
ans=max(record,ans)
return ans
C++
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums)
{
int le=nums.size();
if(le<=1) return le;
int record=1;
int ans=0;
for(int i=0;i<le-1;i++)
{
if(nums[i]<nums[i+1]) record++;
else record=1;
ans=max(record,ans);
}
return ans;
}
};
C语言
int findLengthOfLCIS(int* nums, int numsSize)
{
if(numsSize<=1) return numsSize;
int ans=0;
int record=1;
for(int i=0;i<numsSize-1;i++)
{
if(nums[i]<nums[i+1]) record++;
else record=1;
ans=(ans>record?ans:record);
}
return ans;
}