441. Arranging Coins

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.

方法一、时间复杂度为O(sqrt(n))
int arrangeCoins(int n) {
        if(n<=0)
            return 0;
            
        int count = -1;
        int i = 1;
        while(n>0)
        {
            n-=i;
            i+=1;
            count++;
        }
        
        if(n==0)
            return count+1;
        else
            return count;
    }
改进后的代码1：
int arrangeCoins(int n) {
        if(n<=0)
            return 0;
            
        int count = 0;
        int i = 1;
        while(n>=i)
        {
            n-=i;
            i+=1;
            count++;
        }
        return count;
    }
改进后的代码2：
int arrangeCoins(int n) {
        int level = 1;
        for (long sum = 0; sum <= n; level++) 
            sum += level;
        cout<<level<<endl;
        return max(level - 2, 0);
    }

方法二、数学方法，时间复杂度O(1)
题目的意思其实就是从1~x层完整楼梯硬币数量加起来，要小于等于n，求最大的x。说到加起来的数量，很容易想到求累加和，我们知道求累加和的公式为：sum = (1+x)*x/2
这里就是要求 sum <= n 了。我们反过来求层数x。如果直接开方来求会存在错误，必须因式分解求得准确的x值：
(1+x)*x/2 <= n 
x + x*x <= 2*n 
4*x*x + 4*x <= 8*n 
(2*x + 1)*(2*x + 1) - 1 <= 8*n 
x <= (sqrt(8*n + 1) - 1) / 2
代码：
int arrangeCoins(int n) {
        return (sqrt(8*(long)n + 1) - 1) / 2;
    }

方法三、二分查找法，时间复杂度O(NlgN)
int arrangeCoins(int n) 
{        
	long low = 1, high = n;        
	while (low < high) 
	{            
		long mid = low + (high - low + 1) / 2;            
		if ((mid + 1) * mid / 2.0 <= n) 
			low = mid;            
		else 
			high = mid - 1;        
	}        
	return high;    
}