首页 > 其他 > 详细

[LC] 485. Max Consecutive Ones

时间:2019-12-18 22:32:02      阅读:91      评论:0      收藏: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
class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        int res = 0, cur = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 1) {
                if (i == 0 || nums[i - 1] == 1) {
                    cur += 1;
                } else {
                    cur = 1;
                }
                // case [0, 1] res cover both cases
                res = Math.max(res, cur);
            }
        }
        return res;
    }
}

[LC] 485. Max Consecutive Ones

原文:https://www.cnblogs.com/xuanlu/p/12063962.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!