Given a binary array, find the maximum number of consecutive 1s in this array.
var findMaxConsecutiveOnes = function(nums) {
let ans = 0, tmp = 0, len = nums.length;
nums[len] = 0;
for(let i=0;i<len+1;++i){
if (tmp != tmp+nums[i]) {
tmp += nums[i];
} else {
ans = (ans>tmp)?ans:tmp;
tmp = 0;
}
}
return ans;
};
D67 485. Max Consecutive Ones 题目链接 485. Max Consecutive O...
485.Max Consecutive Ones 这是leetCode第485题 题目 Given a binar...
题目： Given a binary array, find the maximum number of cons...
问题描述：【Array】485. Max Consecutive Ones 解题思路： 因为要找最长连续 1 子数...
题目地址：https://leetcode.com/problems/max-consecutive-ones/d...
485[思路]： 寻找0.1序列中连续为1的子序列的长度； 遍历一次，统计；
描述 Given a binary array, find the maximum number of conse...
Given a binary array, find the maximum number of consecut...
Input: [1,1,0,1,1,1]Output: 3Explanation: The first two d...
https://leetcode.com/problems/max-consecutive-ones/#/desc...
本文标题：#485 Max Consecutive Ones
本文链接：https://www.haomeiwen.com/subject/ybfazttx.html
网友评论