[Leetcode] 485. Max Consecutive Ones

Description:

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) {
        int count = 0;
        int i = 0;
        while (i < nums.length) {
            if (nums[i] == 1) {
                int temp = 1;
                for (int j = 1; j < nums.length-i; j++) {
                    
                    if (nums[i+j] == 1) {
                        temp++;
                    }else{
                        break;
                    }
                    
                }
                if (temp > count)
                    count = temp;
            }
            i++;
        }
        return count;
    }
}