<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>

class Solution {
public:
    string fractionToDecimal(int numerator, int denominator) {
        if (numerator == 0)
            return "0";
        
        string result;
        if ((numerator < 0) != (denominator < 0))
            result += "-";
        
        long n = abs((long)numerator);
        long d = abs((long)denominator);
        
        result += to_string(n / d);
        
        if (n % d == 0) 
            return result;
        
        result += ".";
        unordered_map<int, int> map;
        long rem = n % d;
        
        while(rem != 0)
        {
            if (map.count(rem) > 0) 
            {
                result.insert(map[rem], 1, '(');
                result += ')';
                break;
            }
            
            map[rem] = result.size();
            
            rem *= 10;
            result += to_string(rem / d);
            rem %= d;
        }
        
        return result;
    }
};
8800