diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/kth_largest_element.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/kth_largest_element.cpp')
-rw-r--r-- | other/kth_largest_element.cpp | 25 |
1 files changed, 25 insertions, 0 deletions
diff --git a/other/kth_largest_element.cpp b/other/kth_largest_element.cpp new file mode 100644 index 0000000..c9a60c2 --- /dev/null +++ b/other/kth_largest_element.cpp @@ -0,0 +1,25 @@ +// 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); +} |