0
点赞
收藏
分享

微信扫一扫

Educational Codeforces Round 163 (Rated for Div. 2)(A,B,C,D,E)

捌柒陆壹 03-23 23:30 阅读 2

刚开始做的答案:

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int count = 0;
        for(int i = 0;i <= nums.length;i++ ){
            if(nums[i] == 1){
            count++;

            if(nums[i+1] != 1){
                   System.out.println(count);
            }
        }
        }
        System.out.println(count);
        return count;
    }
    
}

 最后正确的答案:

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int count = 0;
        int maxCount = 0;
        for(int i = 0;i < nums.length;i++ ){
            if(nums[i] == 1){
            count++;
            }else{
                maxCount = Math.max(maxCount,count);
                count = 0;
            }
        }
        maxCount = Math.max(maxCount,count);
        
        return maxCount;
    }
    
}
举报

相关推荐

0 条评论