（leetcode题解）Max Consecutive Ones

标签：二进制   i++   tor   length   bin   his   log   etc   ==   

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

题意是在一个二进制数组中，找到此数组中连续1的最大数。

这个循环一遍记录最大连续值即可，C++实现如下：

    int findMaxConsecutiveOnes(vector<int>& nums) {
        int count=0;
        int max=0;
        for(int i=0;i<nums.size();i++)
        {
            if(nums[i]==1)
            {
                count++;
            }
            else
            {
                count=0;
            }
            if(count>max)
                    max=count;
        }
        return max;
    }

（leetcode题解）Max Consecutive Ones

标签：二进制   i++   tor   length   bin   his   log   etc   ==   

原文地址：http://www.cnblogs.com/kiplove/p/6986225.html