LeetCode 485 - 最大连续1的个数

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        nums.push_back(false);
        int slow =0,fast=0,length=0;
        for(;fast<nums.size();fast++)
        {
            if(!nums[fast])
            {
                length= (fast-slow)>length?fast-slow:length;
                slow=fast+1;
            }
        }
        return length;
    }
};