LeetCode 485. Max Consecutive Ones

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:
Input: [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s.
The maximum number of consecutive 1s is 3.

The input array will only contain 0 and 1.
The length of input array is a positive integer and will not exceed 10,000

分析:设立cnt数组,表示在nums[i]处当前连续的1的值,maxn取其最大的值,在遇到nums[i] == 0的时候更新maxn的值。最后还要更新一下防止最后一个是1.


❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版