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_element_in_stream.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/kth_element_in_stream.cpp')
-rw-r--r-- | other/kth_element_in_stream.cpp | 32 |
1 files changed, 0 insertions, 32 deletions
diff --git a/other/kth_element_in_stream.cpp b/other/kth_element_in_stream.cpp deleted file mode 100644 index 75e5234..0000000 --- a/other/kth_element_in_stream.cpp +++ /dev/null @@ -1,32 +0,0 @@ -#include "leetcode.h" - -class KthLargest { -private: - int k; - priority_queue<int, vector<int>, greater<int>> pq; - -public: - KthLargest(int k, vector<int> &nums) { - this->k = k; - auto endPointer = nums.begin() + min(k, nums.size()); - pq = priority_queue<int, vector<int>, greater<int>>(nums.begin(), - endPointer); - for (int i = k; i < nums.size(); ++i) { - pq.push(nums[i]); - pq.pop(); - } - } - int add(int val) { - pq.push(val); - if (pq.size() > k) - pq.pop(); - return pq.top(); - } -}; - -int main() { - vector<int> nums({4, 5, 8, 2}), stream({3, 5, 10, 9, 4}); - KthLargest *obj = new KthLargest(3, nums); - for (auto num : stream) - cout << obj->add(num) << ' '; -} |