485. Max Consecutive Ones [LeetCode]

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的最大连续数。

---

给出一个简单的思路： 
1.利用变量max变量保存当前最大连续数，每次遍历都与之进行比较； 
2.count变量，记录当前读到位置连续1的个数； 
3.每次循环都要对比max与count，将较大者赋给max; 
4.返回max。

附上代码，如下：

public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int max = 0;
        int count = 0;
        for (int i=0; i
   
   
    
    =count ? max : count);
        }
        return max;
    }
}