485. Max Consecutive Ones

Posted 2020-10-11 lvbbg

 

485. Max Consecutive Ones

---

 

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:

1 Input: [1,1,0,1,1,1]
2 Output: 3
3 Explanation: The first two digits or the last three digits are consecutive 1s.
4 The maximum number of consecutive 1s is 3.

 

Solution1:

 1 class Solution {
 2 public:
 3     int findMaxConsecutiveOnes(vector<int>& nums) {
 4         int a=0;
 5         int b=0;
 6         for (int i = 0; i < nums.size(); i++)
 7             if (nums[i] == 1){
 8                 b++; 
 9             }
10             else{
11                 a = max(a,b);
12                 b=0;
13             }
14         a = max(a, b);
15         return a;
16     }
17 };