Leetcode 166. Fraction to Recurring Decimal

Problem

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.

If multiple answers are possible, return any of them.

It is guaranteed that the length of the answer string is less than 104 for all the given inputs.

Algorithm

Save the remainder and when there is a same remainder, it is a loop.

Code

class Solution:
    def fractionToDecimal(self, numerator: int, denominator: int) -> str:
        if not numerator % denominator:
            return str(numerator // denominator)
        
        sign = 1
        if numerator < 0:
            numerator = -numerator
            sign *= -1
        if denominator < 0:
            denominator = -denominator
            sign *= -1
        
        buf = []
        buf.append(str(numerator // denominator))
        numerator %= denominator
        Map = {numerator:0}
        cnt = 0
        while numerator:
            numerator *= 10
            buf.append(str(numerator // denominator))
            numerator %= denominator
            if numerator in Map:
                break
            cnt += 1
            Map[numerator] = cnt
        
        rlen = cnt - Map[numerator] + 1
        ans = buf[0] + "."
        for i in range(1, len(buf)):
            ans = ans + buf[i]
        if numerator:
            ans = ans[:-rlen] + "(" + ans[-rlen:] + ")"
        if sign < 0:
            ans = "-" + ans
        return ans