<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(long long int n, long long int d) {
        if(n == 0){
            return "0";
        }
        string ans = "";
        if(n<0 ^ d<0){
            ans += '-';
        }
        n = abs(n);
        d = abs(d);
        ans += to_string(n/d);
        n%=d;
        if(n == 0) return ans;
        ans += '.';
        unordered_map<long long,int> m;
        string rep = "";
        int i = 0;
        while(true){
            n *= 10;
            if(m.find(n) != m.end()){
                break;
            }
            m[n] = i;
            rep += to_string(n/d);
            n %= d;
            if(n == 0){
                ans += rep;
                return ans;
            }
            i++;
        }
        ans += rep.substr(0,m[n]);
        ans += '(';
        ans += rep.substr(m[n]);
        ans += ')';
        return ans;
    }
};
8800