leetcode oj java 485. Max Consecutive Ones

一、问题描述：

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.

二、解决思路：

遍历一遍即可。两个变量count 和 max 记录当前为止的最多的连续的1，以及当前位置所在的连续的1的段个数

三、代码：

public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
         int max = 0;
        int count = 0;
        int len = nums.length;
        for (int i = 0; i < len; i++) {
            if (nums[i] == 1) {
                count++;
            } else {
                max = max > count ? max : count;
                count = 0;
            }
        }
        return max>count ? max : count;
    }
}