Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g0401_0500.s0441_arranging_coins.Solution

```
public class Solution
extends Object
```
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 i^th 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^rd row is incomplete, we return 2.

Example 2:

Input: n = 8

Output: 3

Explanation: Because the 4^th row is incomplete, we return 3.

Constraints:
- 1 <= n <= 2³¹ - 1

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int arrangeCoins(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- arrangeCoins
```
public int arrangeCoins(int n)
```