题解 | #最小的K个数# insertion排序法
最小的K个数
http://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf
# -*- coding:utf-8 -*-
def insertionSort(arr):
for i in range(len(arr)):
tmp = arr[i]
j = i
while j>0 and arr[j-1]>tmp:
arr[j] = arr[j-1]
j = j - 1
arr[j] = tmp
class Solution:
def GetLeastNumbers_Solution(self, tinput, k):
insertionSort(tinput)
return tinput[0:k] 
查看12道真题和解析
