215. 数组中的第K个最大元素（C++题解含VS可运行源码）

1.力扣C++源码

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        sort(nums.begin(), nums.end());
        int n = nums.size();
        int ans = nums[n - k];
        return ans;
    }
};

2.题解

使用sort()函数

3.VS可运行源码

#include
#include
#include
#include
#include
#include
#pragma warning(disable:4996)
using namespace std;

class Solution {
public:
	int findKthLargest(vector<int>& nums, int k) {
        sort(nums.begin(), nums.end());
        int n = nums.size();
        int ans = nums[n - k];
        return ans;
	}
};
int main()
{
    printf("请输入数组中元素个数：");
    int x;
    scanf("%d", &x);
    printf("请输入数组元素：");
    int num;
    vector<int> nums;
    for (int i = 0; i < x; i++) {
        scanf("%d", &num);
        nums.push_back(num);
    }
    printf("请输入k：");
    int k;
    scanf("%d", &k);

    Solution test;
    int ans = test.findKthLargest(nums,k);
    printf("第k个最大元素为：%d", ans);


	system("pause");
	return 0;
}