215. 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.

可以用快排的方便，找一个pivot，比pivot大的放在左边，比pivot小的放在右边，这样如果返回的pivot的位置是k-1，就说明，pivot就是第k大的，如果pivot的位置 < k-1，那么第k大的数在右半段，left=pos+1; 否则pivot在左半段， right = pos - 1。

class Solution {
public:
    int partion (vector<int>& nums, int left, int right) {
        int pivot = nums[left];
        int i = right + 1;
        for (int j = right; j>= left; j--) {
            if (nums[j] <= pivot) {
                i--;
                if (i != j) swap(nums[i], nums[j]);
            }
        }
        cout << i << endl;
        return i;
    }
    int findKthLargest(vector<int>& nums, int k) {
        if (nums.size() < k) return 0;
        if (nums.size() == 1) return nums[0];
        int left = 0;
        int right = nums.size() - 1;
        while (true) {
            int pos = partion(nums, left, right);
            if (pos == k-1) return nums[pos];
            if (pos < k - 1) left = pos+1;
            else right = pos -1;
        }
        
    }
};