seq = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
start = [2,9,18]
end = [6,12,20]
#output = seq[end[k]:start[k+1]]
我正在尝试结束[k]和开始[k + 1]之间的序列#seq [end [k]:start [k + 1]]
所以在这种情况下应该有2个序列。
outp1 = seq[6:9] #'GHI'
out2 = seq[12:18] #'MNOPQR'
答案 0 :(得分:5)
使用zip
:
>>> seq = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
>>> start = [2,9,18]
>>> end = [6,12,20]
>>> for x,y in zip(end, start[1:]):
... print seq[x:y]
...
GHI
MNOPQR
内存高效版本:
>>> from itertools import izip,islice
>>> for x,y in izip(end,islice(start,1,None)):
print seq[x:y]
...
GHI
MNOPQR
答案 1 :(得分:3)
for i in range(len(end)-1):
seq[end[i]:start[i+1]]
answer:-
'GHI'
'MNOPQR'