题解：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.

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

解题思路就是新建一个向量把重复的数字剔除，最后排序得出结果，代码比较简单，如下：

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;


bool judge(int a, int b) {
return a > b;
}


int findKthLargest(vector<int>& nums, int k) {
int flag = 0;
vector<int> count;
for (int i = 0; i < nums.size(); i++) {
flag = 0;
for (int l = 0; l < count.size(); l++) {
if (count[l]== nums[i]) {
flag = 1;
break;
}
}
if (flag == 0) {
count.push_back(nums[i]);
}
}
sort(count.begin(), count.end(), judge);
return count[k - 1];
}

其实这道题是划归在分治算法里的，但我总觉得分治会不会反而更麻烦，这道题我会找个时间和别人询问商量看看