fraction-to-recurring-decimal

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two integers representing the <code>numerator</code> and <code>denominator</code> 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 <code>104</code> for all the given inputs.

&nbsp;
Example 1:

<pre>
Input: numerator = 1, denominator = 2
Output: &quot;0.5&quot;
</pre>

Example 2:

<pre>
Input: numerator = 2, denominator = 1
Output: &quot;2&quot;
</pre>

Example 3:

<pre>
Input: numerator = 4, denominator = 333
Output: &quot;0.(012)&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>-231 &lt;=&nbsp;numerator, denominator &lt;= 231 - 1</code></li>
	<li><code>denominator != 0</code></li>
</ul>

fractionToDecimal

Fraction to Recurring Decimal

Hash Table

Math

String

给定两个整数，分别表示分数的分子&nbsp;<code>numerator</code> 和分母 <code>denominator</code>，以 字符串形式返回小数 。

如果小数部分为循环小数，则将循环的部分括在括号内。

如果存在多个答案，只需返回 任意一个 。

对于所有给定的输入，保证 答案字符串的长度小于 <code>104</code> 。

&nbsp;

示例 1：

<pre>
输入：numerator = 1, denominator = 2
输出："0.5"
</pre>

示例 2：

<pre>
输入：numerator = 2, denominator = 1
输出："2"
</pre>

示例 3：

<pre>
输入：numerator = 4, denominator = 333
输出："0.(012)"
</pre>

&nbsp;

提示：

<ul>
	<li><code>-231 &lt;=&nbsp;numerator, denominator &lt;= 231 - 1</code></li>
	<li><code>denominator != 0</code></li>
</ul>