标签：style blog http ar io color os sp for
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.
For example,
Credits:
Special thanks to @Shangrila for adding this problem and creating all test cases.
这题就是按定义做。
如果不能整除，就不断进行余数补零除以除数。
维护一个映射表map<long long, int> m, 用来记录每个余数对应返回值ret中的位置。
（1）当出现重复的余数r时，说明找到了循环体，根据m[r]找到ret中位置，加上相应的‘(‘和‘)‘将循环体括起来即可返回。
（2）当余数r为0时，返回ret。
注意点：可能出现INT_MIN/-1的越界情况，因此第一步现将int转为long long int
class Solution { public: string fractionToDecimal(int numerator, int denominator) { return Helper(numerator, denominator); } string Helper(long long numerator, long long denominator) { //convert to 64_int in case INT_MIN/-1 overflow //special case if(denominator == 0) return ""; else if(numerator == 0) return "0"; string ret = ""; if((numerator<0) ^ (denominator<0)) {//one of them is negative, with bit or ret += ‘-‘; numerator = abs(numerator); denominator = abs(denominator); } //integer part if(numerator/denominator == 0) //integer part is 0 ret += ‘0‘; else { long long quotient = numerator/denominator; ret += to_string(quotient); if(numerator%denominator == 0) //divisible return ret; else //not divisible, numerator as remainder numerator -= (quotient*denominator); } //decimal part ret += ‘.‘; string demical; map<long long, int> m; //<remainder, index> pair long long r = numerator; while(r) { if(m.find(r) != m.end()) {//remainder ret.insert(m[r], 1, ‘(‘); //insert (iterator p, size_t n, char c); ret += ‘)‘; break; } m[r] = ret.size(); r *= 10; //next digit ret += to_string(r/denominator); r %= denominator; } return ret; } };
【LeetCode】Fraction to Recurring Decimal
标签：style blog http ar io color os sp for
原文地址：http://www.cnblogs.com/ganganloveu/p/4170601.html
