Package g0401_0500.s0441_arranging_coins

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    441 - Arranging Coins\.

    Easy

    You have n coins and you want to build a staircase with these coins. The staircase consists of k rows where the <code>i<sup>th</sup></code> row has exactly i coins. The last row of the staircase may be incomplete.

    Given the integer n, return the number of complete rows of the staircase you will build.

    Example 1:

    Input: n = 5

    Output: 2

    Explanation: Because the 3<sup>rd</sup> row is incomplete, we return 2.

    Example 2:

    Input: n = 8

    Output: 3

    Explanation: Because the 4<sup>th</sup> row is incomplete, we return 3.

    Constraints:

    • <code>1 <= n <= 2<sup>31</sup> - 1</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 arrangeCoins(Integer n)

      • Methods inherited from class java.lang.Object

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