Add solution #625

Author: JoshCrozier

README.md

@@ -582,6 +582,7 @@
 622|[Design Circular Queue](./solutions/0622-design-circular-queue.js)|Medium|
 623|[Add One Row to Tree](./solutions/0623-add-one-row-to-tree.js)|Medium|
 624|[Maximum Distance in Arrays](./solutions/0624-maximum-distance-in-arrays.js)|Medium|
+625|[Minimum Factorization](./solutions/0625-minimum-factorization.js)|Medium|
 628|[Maximum Product of Three Numbers](./solutions/0628-maximum-product-of-three-numbers.js)|Easy|
 629|[K Inverse Pairs Array](./solutions/0629-k-inverse-pairs-array.js)|Hard|
 630|[Course Schedule III](./solutions/0630-course-schedule-iii.js)|Hard|

solutions/0625-minimum-factorization.js

@@ -0,0 +1,35 @@
+/**
+ * 625. Minimum Factorization
+ * https://leetcode.com/problems/minimum-factorization/
+ * Difficulty: Medium
+ *
+ * Given a positive integer num, return the smallest positive integer x whose multiplication
+ * of each digit equals num. If there is no answer or the answer is not fit in 32-bit signed
+ * integer, return 0.
+ */
+
+/**
+ * @param {number} num
+ * @return {number}
+ */
+var smallestFactorization = function(num) {
+  if (num < 2) return num;
+
+  const digits = [];
+  for (let divisor = 9; divisor > 1; divisor--) {
+    while (num % divisor === 0) {
+      digits.push(divisor);
+      num /= divisor;
+    }
+  }
+
+  if (num > 1) return 0;
+
+  let result = 0;
+  for (const digit of digits.reverse()) {
+    result = result * 10 + digit;
+    if (result > 2**31 - 1) return 0;
+  }
+
+  return result;
+};