partition思想

输入n个整数，找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字，则最小的4个数字是1,2,3,4,。

# -*- coding:utf-8 -*-
class Solution:

    def GetLeastNumbers_Solution(self, tinput, k):
        if len(tinput) < k:
            return []
        result = []
        self.Partition(tinput, 0, len(tinput)-1)
        for i in range(k):
            result.append(tinput[i])
        return result
    def Partition(self, array, left, right):
        if (left < right):
            pivot = array[left]
            i = left
            j = right
            while (i < j):
                while (i < j) and array[j] >= pivot:
                    j -= 1
                if i < j:
                    array[i] = array[j]
                    i += 1
                while (i < j) and array[i] < pivot:
                    i += 1
                if i < j:
                    array[j] = array[i]
                    j -= 1
            array[i] = pivot
            self.Partition(array, left, i-1)
            self.Partition(array, i+1, right)