【LeetCode 166】 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.

Example 1:

Input: numerator = 1, denominator = 2
Output: "0.5"

Example 2:

Input: numerator = 2, denominator = 1
Output: "2"

Example 3:

Input: numerator = 2, denominator = 3
Output: "0.(6)"

思路

模拟除法过程。

代码

class Solution {
public:
    string fractionToDecimal(int numerator, int denominator) {
        if (numerator == 0) return "0";
        if (denominator == 0) return "";
        string res = "";
        
        if (numerator>0 ^ denominator>0) res += "-";
        long long num1 = abs((long long)numerator);
        long long num2 = abs((long long)denominator);
        res += to_string(num1 / num2);
        long long remain = num1 % num2;
        if (remain) res += ".";
        map<int, int> mp;
       
        while(remain) {
            if (mp[remain]) {
                res.insert(mp[remain], 1, '(');
                res += ")";
                break;
            }
            mp[remain] = res.length();
            remain *= 10;
            res += to_string(remain / num2);
            remain = remain % num2;
        }
        return res;
    }
};

参考链接:https://www.liuchuo.net/archives/3142

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值