Leetcode学习（16）—— 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: 3Explanation: 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

思路：
以 tmp 为暂时计数器 ， result 为结果计数器
当遇到 1 时，tmp+1，将 result 保存为 tmp 和result 两者中较大的
当遇到 0 时， tmp 归零