[LeetCode#116]Fraction to Recurring Decimal
2015-09-03 09:36
357 查看
Problem:
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,
Given numerator = 1, denominator = 2, return "0.5".
Given numerator = 2, denominator = 1, return "2".
Given numerator = 2, denominator = 3, return "0.(6)".
Analysis:
Solution:
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,
Given numerator = 1, denominator = 2, return "0.5".
Given numerator = 2, denominator = 1, return "2".
Given numerator = 2, denominator = 3, return "0.(6)".
Analysis:
Fristly, you man think it's a difficult problem. But when you clam down, you may notice it's not a hard problem, since you have already familar with its underlying algorithm. What you need to do is to write a good code to solve the problem elegantly! Idea: The reason why we have decimal part is the numerator could not be fully divided by denominator. We could divide the process into following part: 1. get quotient part. long quotient = dividend / divisor; res += quotient; 2. get decimal part. Recall what we have done through mannually way. 1 .... 9 |----------- 1 0 9 ------------ 1 0 We need to get remainder, and if the remainder is not equal to 0, we multiply the remainder with 10. And continue the process. while (remainder != 0) { ... map.put(remainder, res.length()); long de = remainder / divisor; res += String.valueOf(de); remainder = (remainder % divisor) * 10; } However, the problem asks us to circle out the repeative part, if the decialmal part is infinite. How could we detect the circle part out? Use our old friend: HashSet, HashMap. And we know if a remainder appear gain, it must be the sign of a circle!!! 1. HashSet We indeed can use it to detect a circle, however, it has no memory of where the circle starts. 2. HashMap We certainly can use it to detect circle, what's more, we can record the next index of each remainder!!! Thus when we reach a circle, we can easily point the circle out. ------------------------------------------------------------------ HashMap<Long, Integer> map = new HashMap<Long, Integer> (); while (remainder != 0) { if (map.containsKey(remainder)) { int beg = map.get(remainder); res = res.substring(0, beg) + "(" + res.substring(beg, res.length()) + ")"; return res; } map.put(remainder, res.length()); long de = remainder / divisor; res += String.valueOf(de); remainder = (remainder % divisor) * 10; } 2.1 record the start(next index) of each remainder map.put(remainder, res.length()); 2.2 get the circular part out. res = res.substring(0, beg) + "(" + res.substring(beg, res.length()) + ")"; Mistake: Directly use Math.abs over Integer. Note: when Integer = Math.MIN_VALUE, Math.abs(Math.MIN_VALUE) has no effect!!! Otherwise, it could cause overflow!!! Fix: store the integer into a long, then use abs over the long. long dividend = Math.abs(numerator); long divisor = Math.abs(denominator);
Solution:
public class Solution { public String fractionToDecimal(int numerator, int denominator) { if (numerator == 0) return "0"; if (denominator == 0) return ""; String res = ""; if ((numerator < 0) ^ (denominator < 0)) res += '-'; long dividend = numerator; long divisor = denominator; dividend = Math.abs(dividend); divisor = Math.abs(divisor); long quotient = dividend / divisor; res += quotient; long remainder = (dividend % divisor) * 10; if (remainder == 0) return res; res += '.'; HashMap<Long, Integer> map = new HashMap<Long, Integer> (); while (remainder != 0) { if (map.containsKey(remainder)) { int beg = map.get(remainder); res = res.substring(0, beg) + "(" + res.substring(beg, res.length()) + ")"; return res; } map.put(remainder, res.length()); long de = remainder / divisor; res += String.valueOf(de); remainder = (remainder % divisor) * 10; } return res; } }
相关文章推荐
- Python
- 8月30日 第六次课作业 作业一
- 解决Studio运行出现Failure [INSTALL_FAILED_OLDER_SDK]
- 70
- 互联网思维PK大数据思维
- 使用NFSv3将HDFS挂载到本地
- hdu 5038 Grade(简单模拟求解)2014 ACM/ICPC Asia Regional 北京 Online
- Android(java)学习笔记205:网易新闻RSS客户端应用编写逻辑过程
- HDU 1201 18岁生日
- Windows Server 2003 R2 64位简体中文版下载
- i++是否原子操作?并解释为什么?
- Java与持久相关的锁总结
- C++标准库set类型
- 1058 部分和问题【dfs+记录】
- JSP笔记――9.Listener介绍
- dhcpd .conf的配置
- JSP笔记――8.Filter介绍
- leetcode Best Time to Buy and Sell Stock
- Android本地服务写法 及 生成脚本
- jsp页面第一行报错问题