Leetcode215. Kth Largest Element in an Array

在未排序的数组中找到第 k 个最大的元素。请注意，你需要找的是数组排序后的第 k 个最大的元素，而不是第 k 个不同的元素。

示例 1:

输入: [3,2,1,5,6,4] 和 k = 2 输出: 5 示例 2:

输入: [3,2,3,1,2,4,5,5,6] 和 k = 4 输出: 4 说明:

你可以假设 k 总是有效的，且 1 ≤ k ≤ 数组的长度。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/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.

Example 1:

Input: [3,2,1,5,6,4] and k = 2 Output: 5 Example 2:

Input: [3,2,3,1,2,4,5,5,6] and k = 4 Output: 4 Note: You may assume k
is always valid, 1 ≤ k ≤ array’s length.

用最小堆，4ms

class Solution {
public:
	struct Heap {
	public:
		//直接构建N元素大顶堆
		Heap(vector<int> nums,int n) {
			N = n;
			data = new int[N + 1];
			int len = nums.size();
			for (int i = 0; i < N;++i) {
				data[i + 1] = nums[i];
			}
			//调整堆
			for (int i = N / 2; i >= 1; i--)
				shiftDown(i);
			for (int i = N; i < len; ++i) {
				if (data[1] < nums[i]) {
					data[1] = nums[i];
					shiftDown(1);
				}
			}
		}
		void shiftDown(int k) {
			while (2 * k <= N) {
				int j = 2 * k;
				if (j + 1 <= N && data[j + 1] < data[j]) j++;
				if (data[k] <= data[j]) break;
				swap(data[k], data[j]);
				k = j;
			}
		}
		int *data;
		int N;
	};
	int findKthLargest(vector<int>& nums, int k) {
		Heap myheap(nums, k);
		return myheap.data[1];
	}
};