LeetCode 0166 - Fraction to Recurring Decimal

Reck Zhang

发布于 2021-08-11 14:51:55

4430

发布于 2021-08-11 14:51:55

文章被收录于专栏：Reck Zhang

Fraction to Recurring Decimal

Desicription

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

Solution

class Solution {
public:
    string fractionToDecimal(long long numerator, long long denominator) {
        if(numerator == 0)
            return "0";
        string res;
        if(numerator < 0 ^ denominator < 0)
            res += "-";
        numerator = abs(numerator);
        denominator = abs(denominator);
        res += to_string(numerator / denominator);
        if(numerator % denominator == 0)
            return res;
        res += ".";
        unordered_map<long long, long long> mp;
        for(long long r = numerator % denominator; r; r %= denominator) {
            if(mp.count(r)) {
                res.insert(mp[r], 1, '(');
                res += ")";
                return res;
            }
            mp[r] = res.size();
            r *= 10;
            res += to_string(r / denominator);
        }
        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-06-04，如有侵权请联系 cloudcommunity@tencent.com 删除

decimal