add 2182

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |------|----------------|---------------|--------|-------------|-------------
+| 2182 |[Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2182.java) ||Medium||
 | 2181 |[Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2181.java) ||Medium||
 | 2180 |[Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2180.java) ||Easy||
 | 2177 |[Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2177.java) ||Medium||

src/main/java/com/fishercoder/solutions/_2182.java

@@ -0,0 +1,53 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.PriorityQueue;
+
+public class _2182 {
+    public static class Solution1 {
+        public String repeatLimitedString(String s, int repeatLimit) {
+            Map<Character, Integer> map = new HashMap<>();
+            for (char c : s.toCharArray()) {
+                map.put(c, map.getOrDefault(c, 0) + 1);
+            }
+            PriorityQueue<Count> heap = new PriorityQueue<Count>((a, b) -> b.c - a.c);
+            for (char c : map.keySet()) {
+                heap.offer(new Count(c, map.get(c)));
+            }
+            StringBuilder sb = new StringBuilder();
+            while (!heap.isEmpty()) {
+                Count curr = heap.poll();
+                int num = Math.min(curr.num, repeatLimit);
+                while (num > 0) {
+                    sb.append(curr.c);
+                    num--;
+                }
+                if (curr.num > repeatLimit) {
+                    Count newCount = new Count(curr.c, curr.num - repeatLimit);
+                    if (!heap.isEmpty()) {
+                        Count next = heap.poll();
+                        sb.append(next.c);
+                        if (next.num > 1) {
+                            heap.offer(new Count(next.c, next.num - 1));
+                        }
+                    } else {
+                        break;
+                    }
+                    heap.offer(newCount);
+                }
+            }
+            return sb.toString();
+        }
+
+        class Count {
+            char c;
+            int num;
+
+            public Count(char c, Integer integer) {
+                this.c = c;
+                this.num = integer;
+            }
+        }
+    }
+}