[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: 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，不是的话从0开始。

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

[leetcode-485-Max Consecutive Ones]

原文：http://www.cnblogs.com/hellowooorld/p/6844605.html