485. Max Consecutive Ones
原题链接:https://leetcode.com/problems/max-consecutive-ones/description/
这道题目级别为easy,实际做起来也是so easy:
/**
* Created by clearbug on 2018/2/26.
*/
public class Solution {
public static void main(String[] args) {
Solution s = new Solution();
System.out.println(s.findMaxConsecutiveOnes(new int[]{1, 1, 0, 1, 1, 1}));
}
public int findMaxConsecutiveOnes(int[] nums) {
int res = 0;
for (int i = 0; i < nums.length; i++) {
int curr = 0;
while (i < nums.length && nums[i] == 1) {
curr++;
i++;
}
if (curr > res) {
res = curr;
}
if (i == nums.length) {
break;
}
}
return res;
}
}
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步