【LeetCode】441. Arranging Coins

题目

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.

题解

这题刚开始用递推，but超时了。
后来想了想，发现了数学方法：
m阶所需要的coins为m(m+1)/2;现有m个硬币，我们可以假设x：
x(x+1) /2 = n;
解一元二次方程，对正根取整，得到能够得到的stair number;
这里很多人不理解为啥向下取整就可以了。其实我们可以发现，假设正根x1向下取整为k,则满足：
k小于等于x1小于k+1;（不能打小于号，也是醉了）
那么当coins为k*（k+1）/2时的stair 数目是k,当coins为(k+1）(k+2)/2时，stair 数目是k+1;
因此对于所有介于k*（k+1）/2与(k+1）(k+2)/2的所有n值，stair number =k;
那么此时的k值就是能够达到的stair number；

class Solution {
public:
    int arrangeCoins(int n) {
       return sqrt(2 * (long)n + 1 / 4.0) - 1 / 2.0;
    }
};

做完这题发现可以回初中重新读书了（表情都发不出来）；