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.
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)"
Example 4:
Input: numerator = 4, denominator = 333 Output: "0.(012)"
Example 5:
Input: numerator = 1, denominator = 5 Output: "0.2"
Constraints:
-231 <= numerator, denominator <= 231 - 1denominator != 0
Solution: Hashtable
Time complexity: O(?)
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 |
// Author: Huahua class Solution { public: string fractionToDecimal(int numerator, int denominator) { stringstream ss,ss2; long long n = numerator; long long d = denominator; if ( n > 0 && d < 0 || n < 0 && d > 0) { ss << "-"; n = abs(n); d = abs(d); } ss << (n / d); long long r = n % d; bool loop = false; int count = 0; int loop_start; if (r) { n = r; ss << "."; unordered_map<int, int> rs; rs[r] = 0; while (r) { n = n*10; r = n % d; ss2 << (n / d); n = r; if (r && rs.count(r)) { loop = true; loop_start = rs[r]; break; } rs[r] = ++count; } if (loop) { auto s2 = ss2.str(); ss << s2.substr(0, loop_start) << "(" << s2.substr(loop_start) << ")"; } else { ss << ss2.str(); } } return ss.str(); } }; |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Paypal
Venmo
huahualeetcode
huahualeetcode
微信打赏
Be First to Comment