[LeetCode Sync] Runtime - 0 ms (100.00%), Memory - 18.2 MB (20.31%)

Author: NinePiece2

Solutions/0166-fraction-to-recurring-decimal/README.md

@@ -0,0 +1,37 @@
+<p>Given two integers representing the <code>numerator</code> and <code>denominator</code> of a fraction, return <em>the fraction in string format</em>.</p>
+
+<p>If the fractional part is repeating, enclose the repeating part in parentheses.</p>
+
+<p>If multiple answers are possible, return <strong>any of them</strong>.</p>
+
+<p>It is <strong>guaranteed</strong> that the length of the answer string is less than <code>10<sup>4</sup></code> for all the given inputs.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> numerator = 1, denominator = 2
+<strong>Output:</strong> &quot;0.5&quot;
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> numerator = 2, denominator = 1
+<strong>Output:</strong> &quot;2&quot;
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> numerator = 4, denominator = 333
+<strong>Output:</strong> &quot;0.(012)&quot;
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>-2<sup>31</sup> &lt;=&nbsp;numerator, denominator &lt;= 2<sup>31</sup> - 1</code></li>
+	<li><code>denominator != 0</code></li>
+</ul>

Solutions/0166-fraction-to-recurring-decimal/solution.py

@@ -0,0 +1,30 @@
+class Solution:
+    def fractionToDecimal(self, numerator: int, denominator: int) -> str:
+        if numerator == 0:
+            return "0"
+        
+        neg = (numerator < 0) != (denominator < 0)
+        result = []
+        if neg:
+            result.append("-")
+
+        num, denom = abs(numerator), abs(denominator)
+        result.append(str(num // denom))
+        num %= denom
+
+        if num == 0:
+            return "".join(result)
+        result.append(".")
+
+        hash_map = {}
+        while num:
+            hash_map[num] = len(result)
+            num *= 10
+            result.append(str(num // denom))
+            num %= denom
+            if num in hash_map:
+                result.insert(hash_map[num], "(")
+                result.append(")")
+                break
+        
+        return "".join(result)