Package g0801_0900.s0829_consecutive_numbers_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    829 - Consecutive Numbers Sum\.

    Hard

    Given an integer n, return the number of ways you can write n as the sum of consecutive positive integers.

    Example 1:

    Input: n = 5

    Output: 2

    Explanation: 5 = 2 + 3

    Example 2:

    Input: n = 9

    Output: 3

    Explanation: 9 = 4 + 5 = 2 + 3 + 4

    Example 3:

    Input: n = 15

    Output: 4

    Explanation: 15 = 8 + 7 = 4 + 5 + 6 = 1 + 2 + 3 + 4 + 5

    Constraints:

    • <code>1 <= n <= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer consecutiveNumbersSum(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait