[leetcode 215] 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.

Example 1:

Input: [3,2,1,5,6,4] and k = 2 Output: 5

Example 2:

Input: [3,2,3,1,2,4,5,5,6] and k = 4 Output: 4

Note:
You may assume k is always valid, 1 ≤ k ≤ array's length.

 

문제풀이:

- k번째 큰 수를 찾는다. 중복된 수도 존재!

- 소팅한 후에 뒤에서 부터 숫자를 찾는다.

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        int answer;
        int len = nums.size();
      
        sort(nums.begin(), nums.end());
     
        
        for(int i=len-1; i>-1; i--){
            
            if(k == 1){
                answer = nums[i];
                break;
            }
            k--;
        }
        return answer;
        
    }
};