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思路：count存储当前连续1的数量，max为最大连续1的数量，遍历数组，遇见0便取count与max的较大者，遇见1则将count加1。要注意最后末尾的1。
转载于:https://www.cnblogs.com/vincent93/p/6686485.html
