LeetCode 485 --- Max Consecutive Ones

来源：互联网发布：广告牌制作什么软件编辑：程序博客网时间：2024/06/14 14:50

题目链接：
LeetCode 485 — Max Consecutive Ones

AC代码：

public class Problem485 {    public static void main(String[] args) {        // TODO Auto-generated method stub        int[] name={1,1,0,1,1,1};        System.out.println(findMaxConsecutiveOnes(name));    }     public static int findMaxConsecutiveOnes(int[] nums) {         int l=0;         int max=0;         for(int i=0;i<nums.length;i++){             if(nums[i]==1){                 l++;                 if(l>max)                     max=l;             }             else{                 l=0;                 continue;             }         }        return max;    }}

0 0

[LeetCode]485 Max Consecutive Ones
[leetcode-485]Max Consecutive Ones
[Leetcode 485 ]Max Consecutive Ones
Leetcode 485 Max Consecutive Ones
leetcode-485-Max Consecutive Ones
leetcode 485 Max Consecutive Ones
LeetCode 485 --- Max Consecutive Ones
Leetcode #485 Max Consecutive Ones
Leetcode 485 Max Consecutive Ones
【LeetCode】485 Max Consecutive Ones
LeetCode-485 Max Consecutive Ones
Max Consecutive Ones[LeetCode 485]
LEETCODE--Max Consecutive Ones
LeetCode: Max Consecutive Ones
【leetcode】Max Consecutive Ones
LeetCode：Max Consecutive Ones
LeetCode Max Consecutive Ones
LeetCode Max Consecutive Ones
用g++编译生成动态链接库 *.so 的方法
1060. Are They Equal
Left Join 右表数据不唯一解决方法
Ubuntu 14.04 SVN服务器搭建
Android 网络
LeetCode 485 --- Max Consecutive Ones
496Next Greater Element
1009时钟
while (n-- > 0) 的用法
hdu1166 敌兵布阵【线段树】
python 里面的单下划线与双下划线的区别
文章标题
LeetCode 495 --- Teemo Attacking
《蜗居：心理健康枕边书》摘录