LeetCode刷题【Array】 Max Consecutive Ones

最新推荐文章于 2021-03-20 21:34:54 发布

SimonCode

最新推荐文章于 2021-03-20 21:34:54 发布

阅读量253

点赞数

分类专栏： LeetCode 文章标签： Array leetcode

本文链接：https://blog.csdn.net/ltxiaoxia/article/details/62427257

版权

LeetCode 专栏收录该内容

49 篇文章 0 订阅

订阅专栏

题目：

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.

Note:

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

解决方法一：Runtime: 11 ms

public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int count=0;
        int max=0;
        for(int i=0;i<nums.length;i++){
            if(nums[i]==0){max=Math.max(count,max);count=0;}
            else count++;
        }
        return Math.max(max,count);
    }
}

参考：

【1】https://leetcode.com/