LeetCode 487. Max Consecutive Ones II
来源:互联网 发布:北交大知行平台注册 编辑:程序博客网 时间:2024/06/05 23:45
Problem Statement
(Source) Given a binary array, find the maximum number of consecutive 1s in this array if you can flip at most one 0.
Example 1:
Input: [1,0,1,1,0]Output: 4Explanation: Flip the first zero will get the the maximum number of consecutive 1s. After flipping, the maximum number of consecutive 1s is 4.
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
Follow up:
What if the input numbers come in one by one as an infinite stream? In other words, you can’t store all numbers coming from the stream as it’s too large to hold in memory. Could you solve it efficiently?
Solution
class Solution(object): def findMaxConsecutiveOnes(self, nums): """ :type nums: List[int] :rtype: int """ n = len(nums) res = 1 memo = {} count = 0 for i in xrange(n): if nums[i] == 0: if count != 0: memo[i-1] = count temp = count if i-1-count >= 0: temp += memo.get(i-count-2, 0) + 1 else: temp += 1 res = max(res, temp) count = 0 else: count += 1 if i == n-1: temp = count if i-count >= 0: temp += memo.get(i-count-1, 0) + 1 res = max(res, temp) return res
0 0
- LeetCode 487. Max Consecutive Ones II
- 487. Max Consecutive Ones II
- [Leetcode] 487. Max Consecutive Ones II 解题报告
- LEETCODE--Max Consecutive Ones
- LeetCode: Max Consecutive Ones
- 【leetcode】Max Consecutive Ones
- LeetCode:Max Consecutive Ones
- LeetCode Max Consecutive Ones
- LeetCode Max Consecutive Ones
- leetCode-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
- 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)
- [00807]调用父类方法
- Leetcode 461. Hamming Distance
- Word Ladder--思路一