215. Kth Largest Element in an Array

Kth Largest Element in an Array

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

For example,
Given [3,2,1,5,6,4] and k = 2, return 5.

Note:
You may assume k is always valid, 1 ≤ k ≤ array’s length.

快速排序的变形以前的快速排序文

class Solution {
    int partition(vector<int> & nums,int start,int end)
    {
        int key=nums[end];
        int i,j;
        i=start-1;
        for(j=start;j<end;j++)
        {
            if(nums[j]>=key)
            {
                i++;
                swap(nums[i],nums[j]);
            }
        }
        swap(nums[i+1],nums[end]);
        return i+1;
    }
    int findhelper(vector<int>& nums, int start, int end, int k)
    {
        if(start==end) return nums[start];
        int i=partition(nums,start,end);
        int len=i+1-start;//nums[start...i]共有len个数
        if(len==k)
        return nums[i];
        else if(len<k)
        return findhelper(nums,i+1,end,k-len);
        else return findhelper(nums,start,i-1,k);

    }

public:
    int findKthLargest(vector<int>& nums, int k) {
        int n=nums.size();
        return findhelper(nums,0,n-1,k);

    }
};

原址排序，最坏情况时间O(n^2), 平均时间 O(nlgn)