485.[leetcode]C++实现最大连续1的个数(Max Consecutive Ones)

1，题目描述

2，代码实现

int findMaxConsecutiveOnes(vector& nums) {
    int count=0,res=0;
    for(int i=0;icount?res:count;
            count=0;
        }
    }
    res=res>count?res:count;
    return res;
}