具体如图所示,一定要凑够30个字吗?还不能是一样的字?amazing
list = [a,b,c] n=3个数,fanwei = [i,j,m,n,o] m=5个数,有m-1=4 个范围 (i,j),(j,m),(m,n),(n,o),计算list中的n个数在m-1哪个范围中的值最多,最多是多少
建立一个过程列表work, 大概的代码思路如下:
work = [ [i,j,数量,最大值]
,[j,m,数量,最大值]
,[m,n,数量,最大值]
,[n,o,数量,最大值]]
work = [ [i,j,0,0]
,[j,m,0, 0]
,[m,n,0,0]
,[n,o,0,0]]
for n in list:
for i in range(len(work)):
if n> work[i][0] and n< work[i][1]:
if n > work[i][3]:
work[i][3] = n
work[i][2] = work[i][2] + 1
for w in work:
print(w)