您的位置 首页 JAVA(2017)

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.

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
public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int count = 0;
        int result = 0;
        for(int i=0;i<nums.length;i++){
            if(nums[i] == 1){
                count ++;
                if(count > result){
                    result = count;
                }                
            }
            if(nums[i] == 0){
                if(count > result){
                    result = count;
                }
                count =0;
            }
        }
        return result;
    }
}
看完了?留个评分呗?
[0人评了分,平均: 0/5]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《LeetCode – 485. Max Consecutive Ones》

发表评论

电子邮件地址不会被公开。

返回顶部