草稿纸:
Python3:
class Solution:
def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
if nums is None or len(nums) == 0:
return 0
count = 0
result = 0
for num in nums:
if num == 1:
count += 1
else:
result = max(result, count)
count = 0
return max(result, count)
Java:
class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int count = 0;
int result = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 1) {
count++;
} else {
result = Math.max(result, count);
count = 0;
}
}
return Math.max(result, count);
}
}