aboutsummaryrefslogtreecommitdiff
path: root/other/kth_largest_element.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'other/kth_largest_element.cpp')
-rw-r--r--other/kth_largest_element.cpp25
1 files changed, 0 insertions, 25 deletions
diff --git a/other/kth_largest_element.cpp b/other/kth_largest_element.cpp
deleted file mode 100644
index c9a60c2..0000000
--- a/other/kth_largest_element.cpp
+++ /dev/null
@@ -1,25 +0,0 @@
-// 215. Kth Largest Element in an Array
-#include "leetcode.h"
-
-/*
- * given an integer array 'nums' and an integer 'k', return the k'th largest
- * element in the array. note that it is the k'th largest elemented in sorted
- * order, not the k'th distinct element. can you solve without sorting?
- */
-
-class Solution {
-public:
- int findKthLargest(vector<int> &nums, int k) {
- priority_queue<int> pq(nums.begin(), nums.end());
- for (int i = 1; i < k; i++)
- pq.pop();
- return pq.top();
- }
-};
-
-int main() {
- Solution obj;
- vector<int> nums = {3, 2, 1, 5, 6, 4};
- int k = 2;
- cout << obj.findKthLargest(nums, k);
-}