add 1792

fishercoder1534 · fishercoder1534 · commit 10e13afbb2ef · 2021-03-14T10:59:39.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1792|[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1792.java) ||Medium|Heap|
 |1791|[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1791.java) ||Medium|Graph|
 |1790|[Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1790.java) ||Easy|String|
 |1785|[Minimum Elements to Add to Form a Given Sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1785.java) ||Medium|Greedy|
diff --git a/src/main/java/com/fishercoder/solutions/_1792.java b/src/main/java/com/fishercoder/solutions/_1792.java
@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+import java.util.PriorityQueue;
+
+public class _1792 {
+    public static class Solution1 {
+        /**
+         * We use the change size to order the elements in the maxHeap.
+         */
+        public double maxAverageRatio(int[][] classes, int extraStudents) {
+            PriorityQueue<double[]> maxHeap = new PriorityQueue<>((a, b) -> -Double.compare(a[0], b[0]));
+            for (int[] c : classes) {
+                maxHeap.offer(new double[]{(double) (c[0] + 1) / (c[1] + 1) - (double) c[0] / c[1], c[0], c[1]});
+            }
+            while (extraStudents-- > 0) {
+                double[] curr = maxHeap.poll();
+                curr[1]++;
+                curr[2]++;
+                curr[0] = (curr[1] + 1) / (curr[2] + 1) - curr[1] / curr[2];
+                maxHeap.offer(curr);
+            }
+            double result = 0.0;
+            int size = maxHeap.size();
+            while (!maxHeap.isEmpty()) {
+                double[] curr = maxHeap.poll();
+                result += curr[1] / curr[2];
+            }
+            return result / size;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1792Test.java b/src/test/java/com/fishercoder/_1792Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._1792;
+import com.fishercoder.solutions._3;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1792Test {
+    private static _1792.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1792.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(0.78333, solution1.maxAverageRatio(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2],[3,5],[2,2]"), 2), 0.00001);
+    }
+
+}
