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
// 40ms, 47%
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int res = 0;
int c = 0;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] == 1) {
c++;
res = max(res, c);
} else {
c = 0;
}
}
return res;
}
};
// 44ms, 14%
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int res = 0;
int c = 0;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] == 1) {
if (i == 0 || nums[i-1] == 1) {
c++;
res = max(res, c);
} else {
c = 1;
res = max(res, c);
}
}
}
return res;
}
};