nums[]第K个最大数字

法一：堆排
class Solution {public:
void maxHeapify(vector& a, int i, int heapSize) {
int l = i * 2 + 1, r = i * 2 + 2, largest = i;
if (l < heapSize && a[l] > a[largest]) { largest = l; }
if (r < heapSize && a[r] > a[largest]) { largest = r; }
if (largest != i) { swap(a[i], a[largest]);
maxHeapify(a, largest, heapSize); } }
void buildMaxHeap(vector& a, int heapSize) {
for (int i = heapSize / 2; i >= 0; --i) {
maxHeapify(a, i, heapSize); } }
int findKthLargest(vector& nums, int k) {
int heapSize = nums.size();
buildMaxHeap(nums, heapSize);
for (int i = num