leetCode刷题记录54_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个硬币，返回可以摆成多少层完整的三角.
/*****************************************************我的解答*************************************************
/**
 * @param {number} n
 * @return {number}
 */
var arrangeCoins = function(n) {
    var stair = 1;
    while(n - stair > 0)
    {
        n -= stair;
        stair++;
    }    
    if(n - stair === 0)
    {
        return stair;
    }    
    else
    {
        return stair - 1;
    }    
};