441. Arranging Coins

1.Question

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.

2.Code

class Solution {
public:
    int arrangeCoins(int n) {
        return sqrt( 2 * double(n) + 0.25 ) - 0.5;
    }
};

3.Note

a.  感觉这个题好蠢……题目提示是用binary search, 其实根据题目可以知道：设 x 是答案, 解方程组就可以得到答案了 

     1+2+...+x <= n

     1+2+...+x + (x+1) > n.

     相应的，其实就是 x = floor( sqrt(2*n + 0.25) - 0.5 ). floor是向下取整. 

    哪用什么binary search...需要注意的是2*n的溢出问题，所以转成double就能Accepted了.