37,720
社区成员
发帖
与我相关
我的任务
分享
def test(A,B):
a = len(A)
b = len(B)
for j in range(0,b):
i = 0
while i <=a:
if B[j]>=max(A):
A.append(B[j])
break
elif A[i] >= B[j]:
A.insert(i,B[j])
break
else:
i = i+1
pass
a = [3]
b = [2,0,5,0.4,1,1.1,10,11,12,0.5]
test(a,b)
print (a)
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# Python 3.6
from bisect import insort
a = [3]
b = [2,0,5,0.4,1,1.1,10,11,12,0.5]
for n in b:
insort(a, n)
print(a)
# [0, 0.4, 0.5, 1, 1.1, 2, 3, 5, 10, 11, 12]
还是有必要提示楼主一下,你在写的是Python不是C语言。