题解 | #最小的K个数#

# -*- coding:utf-8 -*-
class Solution:
    def GetLeastNumbers_Solution(self, tinput, k):
        # write code here
        n=len(tinput)
        ans=[]
        for i in range(n):
            tmp=len(ans)
            left=0
            right=tmp
            idx=0
            while(left<right):
                mid=(left+right)//2
                if ans[mid]>=tinput[i]:
                    right=mid
                    idx=right
                elif ans[mid]<tinput[i]:
                    left=mid+1
                    idx=left
            ans.insert(idx, tinput[i])
        return ans[:k]