mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
27 lines
923 B
HTML
27 lines
923 B
HTML
<p>Given an integer <code>num</code>, return <em>three consecutive integers (as a sorted array)</em><em> that <strong>sum</strong> to </em><code>num</code>. If <code>num</code> cannot be expressed as the sum of three consecutive integers, return<em> an <strong>empty</strong> array.</em></p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> num = 33
|
|
<strong>Output:</strong> [10,11,12]
|
|
<strong>Explanation:</strong> 33 can be expressed as 10 + 11 + 12 = 33.
|
|
10, 11, 12 are 3 consecutive integers, so we return [10, 11, 12].
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> num = 4
|
|
<strong>Output:</strong> []
|
|
<strong>Explanation:</strong> There is no way to express 4 as the sum of 3 consecutive integers.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>0 <= num <= 10<sup>15</sup></code></li>
|
|
</ul>
|