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

二、解题：

class Solution {
public:
    /*
     分析：当遇到一时，启动计数，然后把较大的给max,
     当为零时，停止计数，并将计数归零。

    */
    int findMaxConsecutiveOnes(vector<int>& nums)
    {
        int n = nums.size();
        int count = 0; //暂时的数量
        int max = 0;  //最大的数量
        for (int i = 0; i < n; i++)
        {
            if (nums[i] == 1)
            {
                max = max > ++count ? max : count;
            }
            else
                count = 0;
        }
        return max;
    }

};