Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g0101_0200.s0166_fraction_to_recurring_decimal.Solution

```
public class Solution
extends Object
```
166 - Fraction to Recurring Decimal.
Medium

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.

If multiple answers are possible, return any of them.

It is guaranteed that the length of the answer string is less than 10⁴ for all the given inputs.

Example 1:

Input: numerator = 1, denominator = 2

Output: “0.5”

Example 2:

Input: numerator = 2, denominator = 1

Output: “2”

Example 3:

Input: numerator = 2, denominator = 3

Output: “0.(6)”

Example 4:

Input: numerator = 4, denominator = 333

Output: “0.(012)”

Example 5:

Input: numerator = 1, denominator = 5

Output: “0.2”

Constraints:
- -2³¹ <= numerator, denominator <= 2³¹ - 1
- denominator != 0

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  String fractionToDecimal(int numerator, int denominator)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

fractionToDecimal

public String fractionToDecimal(int numerator,
                                int denominator)