485. Max Consecutive Ones

JIAKAOBO

LeetCode

感谢赞助!

• ㊗️
• 大家
• offer
• 多多！

Problem

Given a binary array nums, return the maximum number of consecutive 1’s in the array.

Example 1:

Input: nums = [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.

Example 2:

Input: nums = [1,0,1,1,0,1]
Output: 2

Code

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