166. Fraction to Recurring Decimal

xiaoxiao2021-02-28  75

class Solution(object):     def fractionToDecimal(self, numerator, denominator):         """         :type numerator: int         :type denominator: int         :rtype: str         """         n, remainder = divmod(abs(numerator), abs(denominator))         sign = '-' if numerator*denominator < 0 else ''         result = [sign+str(n), '.']         stack = []         while remainder not in stack:             stack.append(remainder)             n, remainder = divmod(remainder*10, abs(denominator))             result.append(str(n))              idx = stack.index(remainder)         result.insert(idx+2, '(')         result.append(')')

        return ''.join(result).replace('(0)', '').rstrip('.')

https://leetcode.com/problems/fraction-to-recurring-decimal/#/solutions

转载请注明原文地址: https://www.6miu.com/read-54884.html

最新回复(0)