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/min_rounds_complete_all_tasks.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_rounds_complete_all_tasks.cpp')
-rw-r--r-- | other/min_rounds_complete_all_tasks.cpp | 27 |
1 files changed, 0 insertions, 27 deletions
diff --git a/other/min_rounds_complete_all_tasks.cpp b/other/min_rounds_complete_all_tasks.cpp deleted file mode 100644 index 0d78073..0000000 --- a/other/min_rounds_complete_all_tasks.cpp +++ /dev/null @@ -1,27 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int minimumRounds(vector<int> &tasks) { - unordered_map<int, int> um; - for (auto i : tasks) - um[i]++; - int count = 0; - for (auto i : um) { - int t = i.second; - if (t == 1) - return -1; - count += t / 3; - if (t % 3 != 0) - count++; - } - return count; - } -}; - -int main() { - Solution obj; - vector<int> tasks1 = {2, 2, 3, 3, 2, 4, 4, 4, 4, 4}, tasks2 = {2, 3, 3}; - cout << obj.minimumRounds(tasks1) << endl; - cout << obj.minimumRounds(tasks2) << endl; -} |