Max Consecutive Ones---LeetCode485

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/yangljanfxp/article/details/78487270

题目描述

Given a binary array, find the maximum number of consecutive 1s in this array.
求最长连续1的个数：给定一个二进制数组，求出最长连续的1的个数
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）求最长连续的1的个数，很简单的题，却被我复杂化了….；
2）从数组初始位置开始，若是1，length变成1，数组中有1，length++，同时比较maxlength与length的长度；若没有1，则length置为0，nums[i]继续往后移动。

public int findMaxConsecutiveOnes1(int[] nums){
        int maxlength=0;
        int length=0;
        for(int i=0;i<nums.length;i++){
            if(nums[i]==1){
                length++;
                if(maxlength<length){
                    maxlength=length;
                }
            }else{
                length=0;
            }
        }
        return maxlength;
    }