2024每日刷題（136）

Leetcode—2244. 完成所有任務需要的最少輪數

實現代碼

class Solution {
public:int minimumRounds(vector<int>& tasks) {unordered_map<int, int> map;for(int task: tasks) {map[task]++;}int ans = 0;// freq = 1 -> it's impossible// freq = 2 -> needs 1 round// freq = 3 -> needs 1 round// freq = 3k                           -> needs k rounds// freq = 3k + 1 = 3 * (k - 1) + 2 * 2 -> needs k + 1 rounds// freq = 3k + 2 = 3 * k       + 2 * 1 -> needs k + 1 roundsfor(auto [_, freq]: map) {if(freq == 1) {return -1;} else {ans += (freq + 2) / 3;}}return ans;}
};

運行結果

之后我會持續更新，如果喜歡我的文章，請記得一鍵三連哦，點贊關注收藏，你的每一個贊每一份關注每一次收藏都將是我前進路上的無限動力 ！！！↖(▔▽▔)↗感謝支持！