【LintCode】第k大元素

描述

在数组中找到第k大的元素

python code

class Solution:
# @param k & A a integer and an array
# @return ans a integer
def kthLargestElement(self, k, A):
    self.quick_sort(A, 0, len(A) - 1)
    return A[-k]

def position(self, A, start, end):
    i = start
    j = end
    povit = A[start]

    while( i < j):
        while(i < j and A[j] >= povit):
            j -= 1
        if( i < j ):
            A[i] = A[j]

        while(i < j and A[i] <= povit):
            i += 1
        if (i < j):
            A[j] = A[i]
    A[i] = povit;
    return i

def quick_sort(self, A, start, end):
    if  start < end:
        mid = self.position(A, start, end)
        self.quick_sort(A, start, mid - 1)
        self.quick_sort(A, mid + 1, end)

说明

先使用快速排序给数组排序