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

Subscribe to see which companies asked this question.

func findMaxConsecutiveOnes(_ nums: [Int]) -> Int {
    var count = 0,maxCount = 0
    var i = 0
    while i < nums.count {
        while i < nums.count && nums[i] == 1{
            count += 1
            i += 1
        }
        if count > maxCount {
            maxCount = count
        }
        count = 0
        i += 1
    }
    return maxCount
}