166. Fraction to Recurring Decimal Leetcode Python

hyperbolechi

墨衍会员 · AI 创作全网分发码龄12年

关注

原创最新推荐文章于 2026-03-05 05:18:37 发布 1.4k 阅读 AI 写同款· GEO 优化 ›

processing与arduino互动编程 Arduino开发板对AVR单片机二次编译封装，无需考虑单片机编程寄存器、地址指针等复杂细节processing借助arduino读取各种传感器的数值，控制各种机电装置。阅读详情

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)".

we need to used a hash table to store current numerator to deal with recurring scenarios.

code is as follow:

class Solution:
    # @return a string
    def fractionToDecimal(self, numerator, denominator):
        ## denominator can be 0 but do not need to consider here
        if numerator == 0:
            return '0'
        neg = False
        if numerator > 0 and denominator < 0 or numerator < 0 and denominator > 0:
            neg = True
        if numerator % denominator == 0:
            return str(numerator / denominator)
        numerator = abs(numerator)
        denominator = abs(denominator)
        table = {}
        res = ""
        res += str(numerator / denominator)
        res += '.'
        numerator %= denominator
        i = len(res)
        while numerator:
            if numerator not in table:
                table[numerator] = i
            else:
                i = table[numerator]
                res = res[:i] + '(' + res[i:] + ')'
                if neg:
                    return '-' + res
                else:
                    return res
            numerator = numerator * 10
            res += str(numerator/denominator)
            numerator %= denominator
            i+=1
        if neg:
            return '-' + res
        return res

收录于