mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
38 lines
1.1 KiB
HTML
38 lines
1.1 KiB
HTML
<p>Given two integers representing the <code>numerator</code> and <code>denominator</code> of a fraction, return <em>the fraction in string format</em>.</p>
|
|
|
|
<p>If the fractional part is repeating, enclose the repeating part in parentheses.</p>
|
|
|
|
<p>If multiple answers are possible, return <strong>any of them</strong>.</p>
|
|
|
|
<p>It is <strong>guaranteed</strong> that the length of the answer string is less than <code>10<sup>4</sup></code> for all the given inputs.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> numerator = 1, denominator = 2
|
|
<strong>Output:</strong> "0.5"
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> numerator = 2, denominator = 1
|
|
<strong>Output:</strong> "2"
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> numerator = 4, denominator = 333
|
|
<strong>Output:</strong> "0.(012)"
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>-2<sup>31</sup> <= numerator, denominator <= 2<sup>31</sup> - 1</code></li>
|
|
<li><code>denominator != 0</code></li>
|
|
</ul>
|