leetcode:Fraction to Recurring Decimal

原文地址：http://blog.csdn.net/ljiabin/article/details/42025037

【题目】

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)".

【题意】

给定一个分子和一个分母，以字符串的形式返回该小数。如果小数无限循环的话，用括号扩住循环体。

【官方Solution】

    0.16  
6 ) 1.00
    0 
    1 0       <-- Remainder=1, mark 1 as seen at position=0.
    - 6 
      40      <-- Remainder=4, mark 4 as seen at position=1.
    - 36 
       4      <-- Remainder=4 was seen before at position=1, so the fractional part which is 16 starts repeating at position=1 => 1(6).

The key insight here is to notice that once the remainder starts repeating, so does the divided result.

You will need a hash table that maps from the remainder to its position of the fractional part. Once you found a repeating remainder, you may enclose the reoccurring fractional part with parentheses by consulting the position from the table.

The remainder could be zero while doing the division. That means there is no repeating fractional part and you should stop right away.

Just like the question Divide Two Integers, be wary of edge case such as negative fractions and nasty extreme case such as -2147483648 / -1.

【中文解析】

难点：如何识别循环体？

解决方法：用一个HashMap记录每一个余数，当出现重复的余数时，那么将会进入循环，两个重复余数之间的部分就是循环体。

示例：1/13=0.076923076923076923...，当小数部分第二次出现0时，就意味着开始了循环，那么需要把076923用括号括起来，结果为0.(076923)。

涉及技巧：1）在不断相除的过程中，把余数乘以10再进行下一次相除，保证一直是整数相除；2）HashMap的key和value分别是<当前余数, 对应结果下标>，这样获取076923时就可根据value值来找。

注意点1：考虑正负数，先判断符号，然后都转化为正数；

注意点2：考虑溢出，如果输入为Integer.MIN_VALUE，取绝对值后会溢出。

代码中已添加注释，来看代码：

public class Solution {
    public String fractionToDecimal(int numerator, int denominator) {
        
         if(numerator==0){
        	 return "0";
         }
         if(denominator==0){
        	 return "";
         }
         StringBuilder result=new StringBuilder();
         if((numerator<0)^(denominator<0)){
        	 result.append('-');
         }
         long num=numerator,den=denominator;
         num=Math.abs(num);
         den=Math.abs(den);
    	 result.append(num/den);
         num%=den;
         num*=10;
         if(num==0){
        	 return result.toString();
         }
         result.append(".");
         HashMap<Long, Integer> hashMap=new HashMap<Long, Integer>();
         while(num!=0){
        	 if(hashMap.containsKey(num)){
        		 int index=hashMap.get(num);
        		 result.insert(index, "(");
        		 result.append(")"); 
        		 break;
        	 }
        	 else{
        		 hashMap.put(num, result.length());
        		 result.append(num/den);
                 num%=den;
                 num*=10;
        	 }
         }
         return result.toString();
     
    }
}