給出一個(gè)0-1數(shù)列，問去掉一個(gè)元素，最多有多少個(gè)連續(xù)的1
預(yù)處理每個(gè)連續(xù)的0和1有幾個(gè)，若開頭和結(jié)尾是0的話補(bǔ)上0個(gè)1
#1493
#Runtime: 322 ms (Beats 65.73%)
#Memory: 17.6 MB (Beats 31.25%)
class Solution(object):
def longestSubarray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
one = []
zero = []
ans = 0
t0, t1 = 0, 0
if not nums[0]:
one.append(0)
for j in range(0, len(nums)):
if nums[j]:
if j == 0 or nums[j - 1]:
t1 += 1
else:
if t0:
zero.append(t0)
t1 = 1
t0 = 0
else:
if j == 0 or nums[j - 1] == 0:
t0 += 1
else:
if t1:
one.append(t1)
t1 = 0
t0 = 1
if t1:
one.append(t1)
if t0:
zero.append(t0)
one.append(0)
if not len(zero):
return one[0] - 1
for i in range(0, len(one)):
if i and zero[i - 1] == 1:
ans = max(ans, one[i - 1] + one[i])
else:
ans = max(ans, one[i])
return ans