LeetCode之Max Consecutive Ones
【摘要】 1、题目
Given a binary array, find the maximum number of consecutive 1s in this array.
Example 1:
Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digit...
1、题目
Given a binary array, find the maximum number of consecutive 1s in this array.
Example 1:
-
Input: [1,1,0,1,1,1]
-
Output: 3
-
Explanation: The first two digits or the last three digits are consecutive 1s.
-
The maximum number of consecutive 1s is 3.
Note:
- The input array will only contain
0and1. - The length of input array is a positive integer and will not exceed 10,000
2、代码实现
-
public class Solution {
-
public int findMaxConsecutiveOnes(int[] nums) {
-
if (nums == null) {
-
return 0;
-
}
-
int zero = 0;
-
for (int i = 0; i < nums.length; i++) {
-
if (nums[i] == 0) {
-
++zero;
-
}
-
}
-
if (zero == nums.length) {
-
return 0;
-
}
-
int count = 0;
-
int maxValue = 0;
-
int maxLength = 0;
-
for (int i = 0; i < nums.length; ++i) {
-
if (nums[i] > maxValue) {
-
maxValue = nums[i];
-
}
-
}
-
for (int i = 0; i < nums.length; ++i) {
-
if (nums[i] == maxValue) {
-
for (int j = i; j < nums.length; ++j) {
-
if (nums[j] == maxValue) {
-
count++;
-
} else {
-
break;
-
}
-
}
-
if (maxLength < count) {
-
maxLength = count;
-
}
-
count = 0;
-
}
-
}
-
return maxLength;
-
}
-
}
文章来源: chenyu.blog.csdn.net，作者：chen.yu，版权归原作者所有，如需转载，请联系作者。
原文链接：chenyu.blog.csdn.net/article/details/66473124
【版权声明】本文为华为云社区用户转载文章，如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）