Given a binary array, find the maximum number of consecutive 1s in this array.
Example 1:
Input: [1,1,0,1,1,1]Output: 3Explanation: 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 input array is a positive integer and will not exceed 10,000
题目要求连续1的个数。遍历数组进行判断取最大的连续1的个数即可。
class Solution {public: int findMaxConsecutiveOnes(vector & nums) { int res = 0, cnt = 0; for (int i = 0; i != nums.size(); i++) { if (nums[i] == 1) cnt++; else cnt = 0; res = max(res, cnt); } return res; }};// 36 ms