Leetcode: Fraction to Recurring Decimal

Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.

If the fractional part is repeating, enclose the repeating part in parentheses.

For example,

• Given numerator = 1, denominator = 2, return "0.5".
• Given numerator = 2, denominator = 1, return "2".

• Given numerator = 2, denominator = 3, return "0.(6)"

思路：

    0.16  
6 ) 1.00
    0 
    1 0       <-- Remainder=1, mark 1 as seen at position=0.
    - 6 
      40      <-- Remainder=4, mark 4 as seen at position=1.
    - 36 
       4      <-- Remainder=4 was seen before at position=1, so the fractional part which is 16 starts repeating at position=1 => 1(6).

The key insight here is to notice that once the remainder starts repeating, so does the divided result.

You will need a hash table that maps from the remainder to its position of the fractional part. Once you found a repeating remainder, you may enclose the reoccurring fractional part with parentheses by consulting the position from the table.

The remainder could be zero while doing the division. That means there is no repeating fractional part and you should stop right away.

Just like the question Divide Two Integers, be wary of edge case such as negative fractions and nasty extreme case such as -2147483648 / -1.

以上思路来自leetcode的solution: https://leetcode.com/problems/fraction-to-recurring-decimal/solution/

至于如何解决corner cases, 我使用long int来存储分子分母，解决corner cases,避免大量讨论。

代码：

class Solution {

public:
    string fractionToDecimal(int numerator, int denominator) {
        if(numerator == 0)
            return "0";
        string ret;
        if((numerator < 0 ) ^ (denominator < 0))
            ret += "-";
        
        long int n = abs((long int)numerator);
        long int d = abs((long int)denominator);
        ret += to_string(n / d);
        long int r = n % d;
        if(r == 0)
            return ret;
        else
            ret += '.';
        unordered_map<int, int> map;
        while(r)
        {
            if(map.find(r) != map.end())
            {
                ret.insert(map[r], 1, '(');
                ret += ')';
                break;
            }
            map[r] = ret.size();
            r *= 10;
            ret += to_string(r / d);
            r = r % d;
        }
        return ret;
    }
};