• Question
• Solution

Question

Find the k^th 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.

Solution

Result: Accepted Time: 20 ms

Here should be some explanations.

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

Complexity Analytics

• Time Complexity: $O(nlog(n))$
• Space Complexity: $O(1)$