def multi_find(seq, subseq, i, j):
list = []
while i != -1 and i < j:
list.append(seq.find(subseq,i,j))
i = seq.find(subseq,i,j) + 1
return list
print multi_find(seq, subseq, i, j)
def multi_find(seq, subseq, i, j):
lst = []
loc = seq.find(subseq, i, j) # location of subseq
while loc != -1:
lst.append(loc)
i = loc + 1
loc = seq.find(subseq, i, j)
return lst
import sys
def multi_find(seq, subseq, i, j):
list = []
for x in xrange(j - i):
temp = seq.find(subseq, x + i, j)
if(temp != -1):
list.append(temp)
x += sys.getsizeof(subseq)
else:
x += 1
return list
我认为使用
i
,j
作为在seq
中搜索的范围,并使用另一个变量loc
来保留搜索结果更为清晰。你知道吗像这样的事情可能更接近你想要做的事情。你知道吗
它运行ad返回子字符串中的令牌数,但我不太确定如何增加I
相关问题 更多 >
编程相关推荐