g0401_0500.s0441_arranging_coins.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation
Show all versions of leetcode-in-java21 Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
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 ith
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:**
![](https://assets.leetcode.com/uploads/2021/04/09/arrangecoins1-grid.jpg)
**Input:** n = 5
**Output:** 2
**Explanation:** Because the 3rd row is incomplete, we return 2.
**Example 2:**
![](https://assets.leetcode.com/uploads/2021/04/09/arrangecoins2-grid.jpg)
**Input:** n = 8
**Output:** 3
**Explanation:** Because the 4th row is incomplete, we return 3.
**Constraints:**
* 1 <= n <= 231 - 1