# LeetCode - 0485. Max Consecutive Ones
### 題目網址：https://leetcode.com/problems/max-consecutive-ones/
###### tags: `LeetCode` `Easy`

/*
    -LeetCode format-
    Problem: 485. Max Consecutive Ones
    Difficulty: Easy
    
    by Inversionpeter
*/



class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int counts = 0, maximum = 0;
        for (int i = 0; i != nums.size(); ++i) 
            if (nums[i])
                ++counts;
            else if (i && nums[i - 1])
                maximum = max(maximum, counts), counts = 0;
        return max(maximum, counts);
    }
};