arranging-coins

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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

Given the integer <code>n</code>, return the number of complete rows of the staircase you will build.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/09/arrangecoins1-grid.jpg" style="width: 253px; height: 253px;" />
<pre>
Input: n = 5
Output: 2
Explanation: Because the 3rd row is incomplete, we return 2.
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/09/arrangecoins2-grid.jpg" style="width: 333px; height: 333px;" />
<pre>
Input: n = 8
Output: 3
Explanation: Because the 4th row is incomplete, we return 3.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 231 - 1</code></li>
</ul>

arrangeCoins

Arranging Coins

Math

Binary Search

你总共有&nbsp;<code>n</code>&nbsp;枚硬币，并计划将它们按阶梯状排列。对于一个由 <code>k</code> 行组成的阶梯，其第 <code>i</code> 行必须正好有 <code>i</code> 枚硬币。阶梯的最后一行 可能 是不完整的。

给你一个数字&nbsp;<code>n</code> ，计算并返回可形成 完整阶梯行 的总行数。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/09/arrangecoins1-grid.jpg" style="width: 253px; height: 253px;" />
<pre>
输入：n = 5
输出：2
解释：因为第三行不完整，所以返回 2 。
</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/09/arrangecoins2-grid.jpg" style="width: 333px; height: 333px;" />
<pre>
输入：n = 8
输出：3
解释：因为第四行不完整，所以返回 3 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 231 - 1</code></li>
</ul>