441. Arranging Coins

最新推荐文章于 2024-10-13 00:59:04 发布

gdmmzmj

最新推荐文章于 2024-10-13 00:59:04 发布

阅读量236

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode算法心得

本文链接：https://blog.youkuaiyun.com/gdmmzmj/article/details/53142737

leetcode算法心得专栏收录该内容

226 篇文章

订阅专栏

本文介绍了一种算法问题，即如何使用给定数量的硬币形成一个阶梯形状，每层比上一层多一个硬币。文章通过示例解释了如何计算能够完全形成的阶梯层数，并提供了一个C++实现示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
    int arrangeCoins(int n) {
        if(n==0) return 0;
        int count=1;
        while(1) 
        {

            n=n-count;
            if(n<count+1)
                break;
            count++;
        }
        return count;
    }
};