/**
* leetcode 485. Max Consecutive Ones
* @param nums
* @return
* 2017年2月28日下午3:39:21
*/
public int findMaxConsecutiveOnes(int[] nums) {
int maxLen = 0;
int count = 0;
for (int i = 0; i < nums.length; i++) {
if(nums[i] == 1) {
count++;
}
else{
if(maxLen<=count)
maxLen = count;
count = 0;
}
}
if(maxLen<=count)
maxLen = count;
return maxLen;
}
leetcode 485. Max Consecutive Ones
最新推荐文章于 2024-02-01 04:45:31 发布