diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/kth_largest_element.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/kth_largest_element.cpp')
-rw-r--r-- | other/kth_largest_element.cpp | 25 |
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); -} |