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.

填满前n列总共需要

n*(n+1)/2

解法1：

直接解方程X(X+1)/2=n，注意避免溢出，解得X向下取整

解法2：

二分查找这样的X使得X(X+1)/2<=n，并且X 尽量“靠右”

public class Solution {
    public static int arrangeCoins(int n)
	{
		long lo=1;
		long hi=n;
		long mid=0;
		while(lo<hi)
		{
			mid=lo+(hi-lo)/2;
			long cmp= mid*(mid+1)/2-n;
			if(cmp>0)
				hi=mid-1;
			else if((mid+1)*(mid+2)/2-n<=0)
				lo=mid+1;
			else {
				break;
			}
		}
		return (int) (lo==hi?lo :mid);
	}
}