Solution of LeetCode, Max Consecutive Ones Solution: given a binary array, find the maximum number of consecutive 1s in this array.

max-consecutive-ones-solution

/**
 * @param {number[]} nums
 * @return {number}
 */
var findMaxConsecutiveOnes = function(nums) {
    let count = 0 ;
    let accum = 0;
    
    for(const num of nums) {
        if (num === 1) {
            count+=1
        } else if ( count > accum) {
            accum = count;
            count = 0;
        } else {
            count = 0
        }
    }
    
    return count > accum ? count : accum
};