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 kcoins.

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.

普通直接模拟增长的方法会TLE，本题可以通过数学方式求解，可知i*(i+1)/2 + x  <= n <= (i+1)(i+2)/2，i即为所求，转化为不等式有i <= sqrt(2*n)，当i >3时，有i >= sqrt(n)，这里需要注意2*n可能会超出整数范围，因此，程序如下所示：

class Solution {
    public int arrangeCoins(int n) {
        if (n == 0){
            return 0;
        }
        if (n == 1 || n == 2){
            return 1;
        }
        if (n == 3){
            return 2;
        }
        double base = Math.sqrt(n);
        int left = (int)base, right = (int)(Math.sqrt(2)*base);
        for (int i = left; i <= right; i++){
            if ((((long)(i+2)*(i+1)) >> 1) > (long)n){
                return i;
            }
        }
        return 0;
    }
}