题目来源:
https://leetcode-cn.com/problems/max-consecutive-ones/
题目描述:
代码如下:
class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
if(nums == null) {
return 0;
}
int len = 0;
int max = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 1)
len++;
else {
max = max > len ? max : len;
len = 0;
}
}
return max = max > len ? max : len;
}
}