mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
33 lines
836 B
HTML
33 lines
836 B
HTML
|
<p>给定一个正整数 <code>n</code>，返回 <em>连续正整数满足所有数字之和为 <code>n</code> 的组数</em> 。 </p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示</strong><strong>例 1:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入: </strong>n = 5
|
|||
|
|
<strong>输出: </strong>2
|
|||
|
|
<strong>解释: </strong>5 = 2 + 3，共有两组连续整数([5],[2,3])求和后为 5。</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入: </strong>n = 9
|
|||
|
|
<strong>输出: </strong>3
|
|||
|
|
<strong>解释: </strong>9 = 4 + 5 = 2 + 3 + 4</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入: </strong>n = 15
|
|||
|
|
<strong>输出: </strong>4
|
|||
|
|
<strong>解释: </strong>15 = 8 + 7 = 4 + 5 + 6 = 1 + 2 + 3 + 4 + 5</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示:</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= n <= 10<sup>9</sup></code></li>
|
|||
|
|
</ul>
|