485. Max Consecutive Ones

Problem:

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:

1. The input array will only contain 0 and 1.
2. The length of input array is a positive integer and will not exceed 10,000

思路：

Solution (C++):

int findMaxConsecutiveOnes(vector<int>& nums) {
    if (nums.empty())  return 0;
    int count = 0, res = 0, n = nums.size();
    
    for (int i = 0; i < n; ++i) {
        count = 0;
        while (i < n && nums[i])  { ++count; ++i; }
        res = max(res, count);
    }
    return res;
}

性能：

Runtime: 32 ms  Memory Usage: 9.7 MB

思路：

Solution (C++):

性能：

Runtime: ms  Memory Usage: MB