原题
You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.
Given n, find the total number of full staircase rows that can be formed.
n is a non-negative integer and fits within the range of a 32-bit signed integer.
Example 1:
n = 5
The coins can form the following rows:
¤
¤ ¤
¤ ¤
Because the 3rd row is incomplete, we return 2.
Example 2:
n = 8
The coins can form the following rows:
¤
¤ ¤
¤ ¤ ¤
¤ ¤
Because the 4th row is incomplete, we return 3.
题目分析
返回给定 n 的全数的个数。二分查找。
代码分析
public int ArrangeCoins(int n) {
long low = 1, high = n;
while (low < high)
{
//mid的类型为Long,一定注意!
long mid = low + (high - low + 1) / 2;
if ((mid + 1) * mid / 2.0 <= n)
low = mid;
else high = mid - 1;
}
return (int)high;
}