refactor: solution 1792. Maximum Average Pass Ratio

Author: tzuyi0817

solutions/1792. Maximum Average Pass Ratio/README.md

@@ -55,28 +55,34 @@
  * @return {number}
  */
 const maxAverageRatio = function (classes, extraStudents) {
-  const queue = new MaxPriorityQueue({ priority: x => x.ratio });
+  const n = classes.length;
+  const maxHeap = new MaxPriorityQueue(({ additionRatio }) => additionRatio);
+  let totalRatio = 0;
+
   const enqueue = (pass, total) => {
-    const beforeRatio = pass / total;
-    const afterRatio = (pass + 1) / (total + 1);
+    const ratio = pass / total;
+    const assignRatio = (pass + 1) / (total + 1);
 
-    queue.enqueue({ pass, total, ratio: afterRatio - beforeRatio });
+    maxHeap.enqueue({ pass, total, additionRatio: assignRatio - ratio });
   };
-  let totalRatio = 0;
 
   for (const [pass, total] of classes) {
     enqueue(pass, total);
   }
-  while (extraStudents--) {
-    const { pass, total } = queue.dequeue().element;
+
+  while (extraStudents) {
+    const { pass, total } = maxHeap.dequeue();
 
     enqueue(pass + 1, total + 1);
+    extraStudents -= 1;
   }
-  while (!queue.isEmpty()) {
-    const { pass, total } = queue.dequeue().element;
+
+  while (maxHeap.size()) {
+    const { pass, total } = maxHeap.dequeue();
 
     totalRatio += pass / total;
   }
-  return totalRatio / classes.length;
+
+  return totalRatio / n;
 };
 ```

solutions/1792. Maximum Average Pass Ratio/solution.js

@@ -4,27 +4,33 @@
  * @return {number}
  */
 const maxAverageRatio = function (classes, extraStudents) {
-  const queue = new MaxPriorityQueue({ priority: x => x.ratio });
+  const n = classes.length;
+  const maxHeap = new MaxPriorityQueue(({ additionRatio }) => additionRatio);
+  let totalRatio = 0;
+
   const enqueue = (pass, total) => {
-    const beforeRatio = pass / total;
-    const afterRatio = (pass + 1) / (total + 1);
+    const ratio = pass / total;
+    const assignRatio = (pass + 1) / (total + 1);
 
-    queue.enqueue({ pass, total, ratio: afterRatio - beforeRatio });
+    maxHeap.enqueue({ pass, total, additionRatio: assignRatio - ratio });
   };
-  let totalRatio = 0;
 
   for (const [pass, total] of classes) {
     enqueue(pass, total);
   }
-  while (extraStudents--) {
-    const { pass, total } = queue.dequeue().element;
+
+  while (extraStudents) {
+    const { pass, total } = maxHeap.dequeue();
 
     enqueue(pass + 1, total + 1);
+    extraStudents -= 1;
   }
-  while (!queue.isEmpty()) {
-    const { pass, total } = queue.dequeue().element;
+
+  while (maxHeap.size()) {
+    const { pass, total } = maxHeap.dequeue();
 
     totalRatio += pass / total;
   }
-  return totalRatio / classes.length;
+
+  return totalRatio / n;
 };