public class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
if (nums == null || nums.length < 1) return 0;
int res = 0;
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 1) {
count++;
} else {
res = Math.max(res, count);
count = 0;
}
}
res = Math.max(res, count);
return res;
}
}