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

解题思路：遇0清空，遇1++并比较，O(n)时间

class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
if(nums.size() == 0) return 0;
int max_digit=0;
int temp = 0;

for(int i=0;i<nums.size();i++){

if(nums[i] == 1) {temp++;
if(temp>max_digit) max_digit = temp;
}
else{
temp = 0;
}

}
return max_digit;

}
};