LeetCode #441 - Arranging Coins

最新推荐文章于 2020-04-29 23:49:31 发布

原创最新推荐文章于 2020-04-29 23:49:31 发布 · 146 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文介绍了一种算法问题，即如何使用给定数量的硬币形成一个完整的阶梯形状，每层阶梯比上一层多一个硬币。通过一个简单的C++实现，展示了如何计算可以完全形成的阶梯层数。

题目描述：

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.

把硬币按照第k行排列k个硬币放置，求在第几行排不满。

class Solution {
public:
    int arrangeCoins(int n) {
        int k=0;
        while(true)
        {
            n-=k;
            if(n<0) break;
            k++;
        }
        return k-1;
    }
};