class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int Max = 0;
int sum = 0;
for(auto num:nums)
{
if(num == 1)
{
sum += 1;
Max = max(Max,sum);
}
else
{
sum = 0;
}
}
return Max;
}
};
leetcode每日一题第106天
最新推荐文章于 2024-07-20 22:34:59 发布