add 2244

Author: yinghaoyu

Diff for: README.md

@@ -329,6 +329,7 @@ LeetCode Solution In Hard Way
 |2258|[Number of Flowers in Full Bloom](https://leetcode.cn/problems/escape-the-spreading-fire/) | [C++](./src/Problem_2258_maximumMinutes.cc)|Hard|
 |2251|[Number of Flowers in Full Bloom](https://leetcode.cn/problems/number-of-flowers-in-full-bloom/) | [C++](./src/Problem_2251_fullBloomFlowers.cc)|Hard|
 |2246|[Longest Path With Different Adjacent Characters](https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/) | [C++](./src/Problem_2246_longestPath.cc)|Hard|
+|2244|[Minimum Rounds to Complete All Tasks](https://leetcode.cn/problems/minimum-rounds-to-complete-all-tasks/) | [C++](./src/Problem_2244_minimumRounds.cc)|Medium|
 |2240|[Number of Ways to Buy Pens and Pencils](https://leetcode.cn/problems/number-of-ways-to-buy-pens-and-pencils/description/?envType=daily-question&envId=2023-09-01) | [C++](./src/Problem_2240_waysToBuyPensPencils.cc)|Medium|
 |2218|[Maximum Value of K Coins From Piles](https://leetcode.cn/problems/maximum-value-of-k-coins-from-piles/) | [C++](./src/Problem_2218_maxValueOfCoins.cc)|Hard|
 |2209|[Minimum Obstacle Removal to Reach Corner](https://leetcode.cn/problems/minimum-obstacle-removal-to-reach-corner/) | [C++](./src/Problem_2209_minimumObstacles.cc)|Hard|

Diff for: src/Problem_2244_minimumRounds.cc

@@ -0,0 +1,40 @@
+#include <algorithm>
+#include <vector>
+
+using namespace std;
+
+class Solution
+{
+ public:
+  int minimumRounds(vector<int>& tasks)
+  {
+    std::sort(tasks.begin(), tasks.end());
+    int ans = 0;
+    int diff = 0;
+    int n = tasks.size();
+    for (int i = 0; i < n; i++)
+    {
+      if (i == 0 || tasks[i - 1] == tasks[i])
+      {
+        // 统计相同的数，当然用 unordered_map 缓存也可
+        diff++;
+      }
+      else
+      {
+        if (diff < 2)
+        {
+          return -1;
+        }
+        ans += (diff + 3 - 1) / 3;
+        diff = 1;
+      }
+    }
+    // 计算最后一个相同的数
+    if (diff < 2)
+    {
+      return -1;
+    }
+    ans += (diff + 3 - 1) / 3;
+    return ans;
+  }
+};