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
and1
. - The length of the input array is a positive integer and will not exceed 10,000
Solutions:
class Solution {public:int findMaxConsecutiveOnes(vector<int>& nums) {int maxOnes = 0, count = 0;for(auto i : nums){if(i == 1){++count;}else{count = 0;}if(count > maxOnes)maxOnes = count;}return maxOnes;}};
Question for practice
Comments
Post a Comment