441. Arranging Coins（LeetCode）

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

转载最新推荐文章于 2020-04-29 23:49:31 发布 · 39 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/wujufengyun/p/6922904.html

本文探讨了一个有趣的数学问题——如何用给定数量的硬币搭建完整的阶梯形结构。每个层级的硬币数必须与层级编号相等。文章提供了一个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;
		long long sum = 0;
		int count = 0;
		for (int i = 1; i <= n; i++)
		{
			sum += i;
			if (sum <= n)
				count++;
			else
				break;
		}
		return count;
	}
};

转载于:https://www.cnblogs.com/wujufengyun/p/6922904.html