485. Max Consecutive Ones
2018-03-16 17:05
435 查看
统计二进制流中连续1的最大个数:遍历一遍二进制流,及时更新最大连续1个数class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int count=0,res=0;
for(int i=0,j=0;i<nums.size();i++)
{
if(nums[i]==1)
{
if(i==nums.size()-1)
res=max(res,i-j+1);
}
else
{
res=max(res,i-j);
i=j;
j++;
}
}
return res;
}
};
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int count=0,res=0;
for(int i=0,j=0;i<nums.size();i++)
{
if(nums[i]==1)
{
if(i==nums.size()-1)
res=max(res,i-j+1);
}
else
{
res=max(res,i-j);
i=j;
j++;
}
}
return res;
}
};
相关文章推荐
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones*
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- LeetCode-485-Max Consecutive Ones-E
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones