<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) {
        string ans;
        int c=0;
        if(numerator==0)
        {
            return "0";
        }
        if(denominator==0)
        {
            return "undefined";
        }
        long long num=numerator;
        long long dem=denominator;
        if(num<0)
        {
            c++;
            num*=-1;
        }
        if(dem<0)
        {
            c++;
            dem*=-1;
        }
        long long quo=num/dem;
        long long rem=num%dem;
        ans+=to_string(quo);
        if(c%2!=0)
        {
           ans.insert(0,"-");
        }
        if(rem==0)
        {
            return ans;
        }
        else
        {
            ans+='.';
            unordered_map<long,int>mp;
            while(rem>0)
            {
                if(mp.find(rem)!=mp.end())
                {
                    ans.insert(mp[rem],"(");
                    ans.insert(ans.size(),")");
                    break;
                }
                else
                {
                    mp.insert({rem,ans.size()});
                    rem*=10;
                    quo=rem/dem;
                    ans+=to_string(quo);
                    rem=rem%dem;
                }
            }
        }
        return ans;
    }
};
9000