Given a positive integer?N, how many ways can we write it as a sum of?consecutive positive integers?
Example 1:
Input: 5
Output: 2
Explanation: 5 = 5 = 2 + 3
Example 2:
Input: 9
Output: 3
Explanation: 9 = 9 = 4 + 5 = 2 + 3 + 4
Example 3:
Input: 15
Output: 4
Explanation: 15 = 15 = 8 + 7 = 4 + 5 + 6 = 1 + 2 + 3 + 4 + 5
Note:?1 <= N <= 10 ^ 9.
Github 同步地址:
https://github.com/grandyang/leetcode/issues/829
参考资料:
https://leetcode.com/problems/consecutive-numbers-sum/
LeetCode All in One 题目讲解汇总(持续更新中...)
[LeetCode] 829. Consecutive Numbers Sum 连续数字之和
原文:https://www.cnblogs.com/grandyang/p/11595236.html