LeetCode 485. Max Consecutive Ones
来源:互联网 发布:北交大知行平台注册 编辑:程序博客网 时间:2024/05/16 12:20
Problem Statement
(Source) Given a binary array, find the maximum number of consecutive 1
s 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
Solution
class Solution(object): def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ n, count = len(nums), 0 cur = 0 for i in xrange(n): if nums[i] == 1: cur += 1 if i == n-1: count = max(count, cur) else: count = max(count, cur) cur = 0 return count
0 0
- LeetCode 485. Max Consecutive Ones
- 【Leetcode】485. Max Consecutive Ones
- LeetCode 485. Max Consecutive Ones
- LeetCode - 485. Max Consecutive Ones
- LeetCode--485. Max Consecutive Ones
- LeetCode 485. Max Consecutive Ones
- 485. Max Consecutive Ones [LeetCode]
- LeetCode : 485. Max Consecutive Ones
- 【LeetCode】485. Max Consecutive Ones
- LeetCode--485. Max Consecutive Ones
- LeetCode 485. Max Consecutive Ones
- leetcode--485. Max Consecutive Ones
- leetcode 485. Max Consecutive Ones
- leetcode 485. Max Consecutive Ones
- LeetCode-485. Max Consecutive Ones
- [LeetCode]485. Max Consecutive Ones
- LeetCode 485. Max Consecutive Ones
- LeetCode | 485. Max Consecutive Ones
- 使用Jquery与vuejs操作dom比较
- UIVIew 的opaque属性
- 2014.3 USACO月赛T2 The Lazy Cow
- Python Day1
- Go in action
- LeetCode 485. Max Consecutive Ones
- 面向对象的设计原则和设计模式
- Mac OS下包管理器Homebrew的安装与使用
- LeetCode 487. Max Consecutive Ones II
- A - Lesha and array splitting
- *.do的项目
- APACHE LOG4J™ 2 学习笔记-log4j2 环境部署到各种类型输出+maven\mysql\滚动文件\控制台\异步\过滤器
- OpenCV3.0 Examples学习笔记(12)-houghlines.cpp-通过HoughLinesP函数实现直线检测
- JZOJ 3853. 【NOIP2014八校联考第2场第2试9.28】帮助Bsny(help)