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/min_rounds_complete_all_tasks.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/min_rounds_complete_all_tasks.cpp')
-rw-r--r-- | other/min_rounds_complete_all_tasks.cpp | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/other/min_rounds_complete_all_tasks.cpp b/other/min_rounds_complete_all_tasks.cpp new file mode 100644 index 0000000..0d78073 --- /dev/null +++ b/other/min_rounds_complete_all_tasks.cpp @@ -0,0 +1,27 @@ +#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; +} |