consecutive-numbers-sum

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 an integer <code>n</code>, return the number of ways you can write <code>n</code> as the sum of consecutive positive integers.

&nbsp;
Example 1:

<pre>
Input: n = 5
Output: 2
Explanation: 5 = 2 + 3
</pre>

Example 2:

<pre>
Input: n = 9
Output: 3
Explanation: 9 = 4 + 5 = 2 + 3 + 4
</pre>

Example 3:

<pre>
Input: n = 15
Output: 4
Explanation: 15 = 8 + 7 = 4 + 5 + 6 = 1 + 2 + 3 + 4 + 5
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>

consecutiveNumbersSum

Consecutive Numbers Sum

Math

Enumeration

给定一个正整数 <code>n</code>，返回 连续正整数满足所有数字之和为 <code>n</code>&nbsp;的组数 。&nbsp;

&nbsp;

示例 1:

<pre>
输入: n = 5
输出: 2
解释: 5 = 2 + 3，共有两组连续整数([5],[2,3])求和后为 5。</pre>

示例 2:

<pre>
输入: n = 9
输出: 3
解释: 9 = 4 + 5 = 2 + 3 + 4</pre>

示例 3:

<pre>
输入: n = 15
输出: 4
解释: 15 = 8 + 7 = 4 + 5 + 6 = 1 + 2 + 3 + 4 + 5</pre>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= n &lt;= 109</code>​​​​​​​</li>
</ul>