485. Max Consecutive Ones

最新推荐文章于 2024-12-07 07:15:00 发布

原创最新推荐文章于 2024-12-07 07:15:00 发布 · 327 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java leetcode

leetcode 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一种高效的方法来找出二进制数组中最大数量的连续1。通过遍历数组并使用标志变量跟踪当前连续1的数量，该算法能确定最大连续1的长度。输入数组仅包含0和1，长度为正整数且不超过10,000。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 0 and 1.

The length of input array is a positive integer and will not exceed 10,000

public class fuzhi {
	  		
	  public int findMaxConsecutiveOnes(int[] nums){
		  int times = 0;
		  int flag=0;
		  for(int i=0;i<nums.length;i++){
			  if(nums[i]==0) flag=0;
			  else{
				  flag=flag+1;
				  times=Math.max(flag, times);
			  }
		  }
		  return times;
		  
	  }
   
	public static void main(String[] args){
    	int[] nums={0,1,1,0,0,1,1,1,0,1,1,1,1};
    	fuzhi r = new fuzhi(); 
    	System.out.println(r.findMaxConsecutiveOnes(nums));
    }
}