Max Consecutive Ones
来源:互联网 发布:linux ntp手动同步 编辑:程序博客网 时间:2024/06/05 23:57
原题地址:点我传送
很简单,一次遍历并计数就可以了。
Java:
public class Solution { public int findMaxConsecutiveOnes(int[] nums) { int count = 0; int max = 0; for(int x: nums) { if(x==1) { count++; max = count > max ? count : max; } else { count=0; } } return max; }}
0 0
- 485. Max Consecutive Ones*
- 485. Max Consecutive Ones
- LEETCODE--Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- Max Consecutive Ones
- LeetCode_485. Max Consecutive Ones
- 485. Max Consecutive Ones
- 485. Max Consecutive Ones
- leetcode485: Max Consecutive Ones
- 485. Max Consecutive Ones
- LeetCode: Max Consecutive Ones
- 485. Max Consecutive Ones
- 【leetcode】Max Consecutive Ones
- LeetCode:Max Consecutive Ones
- 485. Max Consecutive Ones
- Max Consecutive Ones
- oracl expdp
- lua pairs和ipairs的区别
- 一起做RGB-D SLAM 第二季 (二)
- 可按任意字段排序的分页存储过程
- zabbix
- Max Consecutive Ones
- Java中DatabaseMetaData 元数据信息
- eclipse 创建maven项目设置默认jdk版本
- 欢迎使用CSDN-markdown编辑器
- React Native
- Java桌面应用程序
- 动态规划 && 矩阵快速幂
- 投稿时如何推荐审稿人?
- LayChat NET聊天室源码 WebIM源码