首页 > 代码库 > LeetCode-485. Max Consecutive Ones
LeetCode-485. Max Consecutive Ones
Given a binary array, find the maximum number of consecutive 1s in this array.
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.
public class Solution { public int findMaxConsecutiveOnes(int[] nums) { if (nums == null) return 0; int sum = 0, b = 0; for (int v : nums) { b += v; if (v == 0) b = 0; if (sum < b) sum = b; } return sum; } }
LeetCode-485. Max Consecutive Ones
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。