描述
给定一个二进制数组 nums , 计算其中最大连续 1 的个数。
class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
int left = 0, right = 0;
int ans = 0;
while (right < nums.length) {
if (nums[right] == 0) {
right++;
continue;
}
left = right;
while (right < nums.length && nums[right] == 1) {
right++;
}
ans = Math.max(ans,right - left);
}
return ans;
}
}