485. Max Consecutive Ones
来源:互联网 发布:淘宝小也香水是正品吗 编辑:程序博客网 时间:2024/06/16 07:55
Given a binary array, find the maximum number of consecutive 1s in this array.
Example 1:
Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.
Note:
- The input array will only contain
0
and1
. - The length of input array is a positive integer and will not exceed 10,000
public class Solution { public int findMaxConsecutiveOnes(int[] nums) { int count1=0,max=0; for(Integer a:nums) { if(a==0){ count1=0; } else{ count1++; max=Math.max(count1,max);//放在这里更好 } } return max; }
阅读全文
0 0
- 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
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485.Max Consecutive Ones
- 读书共享 Primer Plus C-part 7-10
- 维护篇 15. 指定 IP 访问防火墙 ❀ 飞塔 (Fortinet) 防火墙
- JS表单验证-12个常用的JS表单验证
- log4j框架logger的继承关系以及使用场景
- El表达式的引入:
- 485. Max Consecutive Ones
- JS学习之包装对象与日期对象
- BZOJ 2086--[Poi2010]Blocks【单调栈】
- HDU 4027 Can you answer these queries?(线段树单点更新+询问+神坑)
- 使用VS2013创建C#的dll文件
- halcon图像旋转
- Kotlin入门(6)条件分支的实现
- 环信接入报错解决方案
- IAR如何生成库和使用库