LeetCode 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: 3Explanation: 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

Subscribe to see which companies asked this question.

class Solution {public:    int findMaxConsecutiveOnes(vector<int>& nums) {        int count= 0;//用于计算连续1的个数        int max=0;//用于标记连续1的个数的最大数值        int size=nums.size();        for(int i=0;i<size;i++)        {            if(nums[i]==1)            {                count++;                if(count>max)                max=count;            }            else if(nums[i]==0)            {                if(count>max)                max=count;                count=0;            }        }        return max;    }};

此题简单，就不多赘述了。。。。。。