首页 > 代码库 > leetcode 166: Fraction to Recurring Decimal
leetcode 166: Fraction to Recurring Decimal
Fraction to Recurring Decimal
Total Accepted: 3168 Total Submissions: 27432Given 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,
- Given numerator = 1, denominator = 2, return "0.5".
- Given numerator = 2, denominator = 1, return "2".
- Given numerator = 2, denominator = 3, return "0.(6)".
[分析]
关键是确定发生循环的位置, 使用map存所有余数, 当余数已经出现过时, 即发生了循环.
[注意]
Overflow, 符号的处理, 分开两个函数, 使代码更容易读
[CODE]
public class Solution { public String fractionToDecimal(int numerator, int denominator) { long num = numerator; long den = denominator; boolean neg = num * den < 0; num = Math.abs(num); den = Math.abs(den); String res = neg ? "-" + Long.toString(num/den) : Long.toString(num/den); long remainder = num%den; return (remainder==0) ? res : (res + "." + getDec(remainder, den)); } private StringBuilder getDec(long remainder, long den) { Map<Long, Integer> map = new HashMap<Long, Integer>(); int i=0; StringBuilder sb = new StringBuilder(); while(remainder!=0 && !map.containsKey(remainder)) { map.put(remainder, i); ++i; remainder *= 10; sb.append(Long.toString(remainder/den)); remainder %= den; } if(remainder!=0){ sb.insert((int)map.get(remainder), '('); sb.append(')'); } return sb; } }
leetcode 166: Fraction to Recurring Decimal
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。