leetcode-441. Arranging Coins

最新推荐文章于 2025-09-07 20:32:33 发布

weixin_30877227

最新推荐文章于 2025-09-07 20:32:33 发布

阅读量73

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/lcbg/p/6580728.html

本文介绍了一种算法，用于计算给定数量的硬币可以形成的完整阶梯行数。通过数学公式推导，提供了高效的解决方案，并给出了两个示例帮助理解。

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.

public class Solution {
    public int arrangeCoins(int n) {
        int a=1;
        for(int i=n;i>0;i--){
            a=(int)Math.sqrt(i*2);
            if(i*2%a==0&&i*2%(a+1)==0)
                break;
        }
        return a;
    }
}

　　上面的代码会超时，使用下面的代码:

public class Solution {
    public int arrangeCoins(int n) {
        return (int) Math.floor((-1 + Math.sqrt(1+8*(long)n))/2.0);//Math.floor（n）取小于等于n的最大整数返回double型
    }
}

转载于:https://www.cnblogs.com/lcbg/p/6580728.html