leetcode 485[easy]---Max Consecutive Ones
来源:互联网 发布:淘宝差评有什么后果 编辑:程序博客网 时间:2024/05/21 22:42
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
and1
. - The length of input array is a positive integer and will not exceed 10,000
思路:找到array中最长的连续1的个数。
阅读全文