首页 > 其他 > 详细

Max Consecutive Ones

时间:2017-09-03 09:45:23      阅读:263      评论:0      收藏:0      [点我收藏+]

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

 

分析:计算1连续出现的最大次数。

思路:遍历统计次数,记录下连续出现的次数即可。

JAVA CODE

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int times = 0, maxTimes = 0;
        for(int i = 0; i < nums.length; i++){
            if(nums[i] == 0){
                maxTimes = maxTimes > times ? maxTimes : times;
                times = 0;
            }else{
                times++;
            }
        }
        return maxTimes = maxTimes > times ? maxTimes : times;
    }
}

 

 

 

Max Consecutive Ones

原文:http://www.cnblogs.com/baichangfu/p/7468688.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!