def insertSort(nums)
length=len(nums)
if length==1:
return nums
for i in range(1,length):
j=i-1
key=nums[i]
while j>=0 and nums[j]>key:
nums[j+1]=nums[j]
j-=1
nums[j+1]=key
return nums
<几天一题>插入排序
最新推荐文章于 2022-08-12 00:27:55 发布