Kth Largest Element in an Array_Week3

Kth Largest Element in an Array_Week3

题目：(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.

难度: Medium

解题思路：
按照书中给出的算法思想，用分治的方法来解决该问题。
为了简单，取数组中第一个数做分界点，遍历数组将数组分成，小于第一个数的、等于第一个数的、大于第一个数的数组；根据数组大小计数来判断第k大的数应该再哪一个数组里，再继续将数组分下去、直到找到该数。

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

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        return findKthSmallest(nums,nums.size()-k+1);
    }
    int findKthSmallest(vector<int> nums, int k) {
        //将数组按第一个数大小分为小于、等于、大于第一个数的数组
        sperate(nums);
        //判断第k小的数在哪一个数组里
        if (numsSmaller.size() >= k) {
            return findKthSmallest(numsSmaller,k);
        } else if (k > (numsSmaller.size() + numsEqual.size())) {
            return findKthSmallest(numsLarger,k - numsSmaller.size() - numsEqual.size());
        } else {
            return numsEqual[0];
        }
    }
    void sperate(vector<int> nums) {
        numsSmaller.clear();
        numsEqual.clear();
        numsLarger.clear();
        int length = nums.size();
        int firstNum = nums[0];
        numsEqual.push_back(firstNum);
        for (int i = 1; i < length; i++) {
            if (nums[i] > firstNum) {
                numsLarger.push_back(nums[i]);
            } else if (nums[i] < firstNum) {
                numsSmaller.push_back(nums[i]);
            } else {
                numsEqual.push_back(nums[i]);
            }
        }
    }
private:
    vector<int> numsSmaller, numsEqual, numsLarger;
};