Medium
Fraction to Recurring Decimal — C++
Full explanation · Time O(logn) · Space O(1)
// Time: O(logn), where logn is the length of result strings
// Space: O(1)
class Solution {
public:
string fractionToDecimal(int numerator, int denominator) {
string result;
if ((numerator ^ denominator) >> 31 && numerator != 0) {
result = "-";
}
auto dvd = llabs(numerator);
auto dvs = llabs(denominator);
result += to_string(dvd / dvs);
dvd %= dvs;
if (dvd > 0) {
result += ".";
}
unordered_map<long long, int> lookup;
while (dvd && !lookup.count(dvd)) {
lookup[dvd] = result.length();
dvd *= 10;
result += to_string(dvd / dvs);
dvd %= dvs;
}
if (lookup.count(dvd)) {
result.insert(lookup[dvd], "(");
result.push_back(')');
}
return result;
}
};