-
Notifications
You must be signed in to change notification settings - Fork 0
/
MaxOneSeq.py
32 lines (29 loc) · 1.02 KB
/
MaxOneSeq.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
def findSeqBeg(a):
zero = -1
prevZero = -1
prevSum = -1
sum1 = -1
lastzero = -1
for i in range(len(a)-1):
if not a[i]:
if a[i+1] > 0:
lastzero = i
prevZero = zero if zero != -1 else -1
zero = i
print(prevZero, zero)
if a[i-1] == 1:
if prevZero != -1:
print("----------", prevZero, zero, prevSum, sum1)
if sum1 != -1:
prevSum = sum1
sum1 = zero - prevZero - 1
print("-s--------", prevSum, sum1)
if sum1 != -1 and prevSum != -1:
print("$$$$$$$ {}".format(sum1+prevSum+1))
if a[-1] == 1 and lastzero == zero:
print("---------->", prevSum+len(a)-prevZero)
a = [1,0,1,1,1,1,0,1,1,0,1,0,1]
a = [0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1]
a = [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1]
a = [0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1]
findSeqBeg(a)