add 4065

Author: fishercoder1534

paginated_contents/algorithms/5th_thousand/README.md

@@ -1,5 +1,6 @@
 | #    | Title                                                                                                                                                                                 | Solutions                                                                                                                        | Video                                | Difficulty | Tag                                                                  
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------|--------------------------------------|------------|----------------------------------------------------------------------
+| 4065 | [Rearrange Array by Removing Distinct Values](https://leetcode.com/problems/rearrange-array-by-removing-distinct-values/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4065.java) |                                      | Easy       |
 | 4056 | [Number of Intersecting Interval Pairs I](https://leetcode.com/problems/number-of-intersecting-interval-pairs-i/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4056.java) |                                      | Easy       |
 | 4052 | [Cyclically Shift Rows and Columns](https://leetcode.com/problems/cyclically-shift-rows-and-columns/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4052.java) |                                      | Easy       |
 | 4048 | [Count Values With Equally Spaced Occurrences I](https://leetcode.com/problems/count-values-with-equally-spaced-occurrences-i/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4048.java) |                                      | Easy       |

src/main/java/com/fishercoder/solutions/fifththousand/_4065.java

@@ -0,0 +1,52 @@
+package com.fishercoder.solutions.fifththousand;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.PriorityQueue;
+
+public class _4065 {
+    public static class Solution1 {
+        public int[] rearrangeArray(int[] nums) {
+            Map<Integer, Integer> map = new HashMap<>();
+            for (int key : nums) {
+                map.put(key, map.getOrDefault(key, 0) + 1);
+            }
+            PriorityQueue<int[]> pq =
+                    new PriorityQueue<>(
+                            (a, b) -> {
+                                if (a[0] != b[0]) {
+                                    return a[0] - b[0];
+                                }
+                                return a[1] - b[1];
+                            });
+            for (int key : map.keySet()) {
+                pq.offer(new int[] {key, map.get(key)});
+            }
+            int[] res = new int[nums.length];
+            int i = 0;
+            PriorityQueue<int[]> pq2 =
+                    new PriorityQueue<>(
+                            (a, b) -> {
+                                if (a[0] != b[0]) {
+                                    return a[0] - b[0];
+                                }
+                                return a[1] - b[1];
+                            });
+            while (!pq.isEmpty()) {
+                int size = pq.size();
+                for (int index = 0; index < size && i < nums.length; index++) {
+                    int[] cur = pq.poll();
+                    res[i++] = cur[0];
+                    if (cur[1] > 1) {
+                        pq2.offer(new int[] {cur[0], cur[1] - 1});
+                    }
+                }
+                if (!pq2.isEmpty()) {
+                    pq.addAll(pq2);
+                    pq2.clear();
+                }
+            }
+            return res;
+        }
+    }
+}

src/test/java/com/fishercoder/fifththousand/_4065Test.java

@@ -0,0 +1,23 @@
+package com.fishercoder.fifththousand;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+import com.fishercoder.solutions.fifththousand._4065;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _4065Test {
+    private _4065.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _4065.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(
+                new int[] {1, 2, 3, 1, 3, 3},
+                solution1.rearrangeArray(new int[] {3, 1, 3, 2, 1, 3}));
+    }
+}