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/course_schedule_3.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/course_schedule_3.cpp')
-rw-r--r-- | other/course_schedule_3.cpp | 27 |
1 files changed, 0 insertions, 27 deletions
diff --git a/other/course_schedule_3.cpp b/other/course_schedule_3.cpp deleted file mode 100644 index e13d2ca..0000000 --- a/other/course_schedule_3.cpp +++ /dev/null @@ -1,27 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int scheduleCourse(vector<vector<int>> &courses) { - int time = 0; - priority_queue<int> pq; - sort(courses.begin(), courses.end(), compare); - for (int i = 0; i < courses.size(); i++) { - if (time + courses[i][0] <= courses[i][1]) { - time += courses[i][0]; - pq.push(courses[i][0]); - } else { - if (!pq.empty() && pq.top() > courses[i][0]) { - pq.pop(); - time -= pq.top(); - time += courses[i][0]; - pq.push(courses[i][0]); - } - } - } - return pq.size(); - } - -private: - static bool compare(vector<int> a, vector<int> b) { return a[1] < b[1]; } -}; |