【leetcode】441. Arranging Coins【E】

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

原创最新推荐文章于 2024-10-13 00:59:04 发布 · 466 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#math #leetcode题解 #leetcode #python

Python 同时被 3 个专栏收录

176 篇文章

订阅专栏

leetcode

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

本文介绍了一种使用Python解决硬币排列成阶梯形状的问题的方法。具体目标是在给定数量的硬币(n)的情况下，形成一个阶梯形状，每层比上一层多一个硬币，直至无法完整形成下一层为止。文章提供了一个简洁高效的解决方案，并附带了示例说明。

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.

Subscribe to see which companies asked this question

这道题简直不能更简单，可不知道为啥通过率竟然这么低。。

其实就是

1+2+……+k < n, 求最大的k是多少

class Solution(object):
    def arrangeCoins(self, n):
        res = 0
        while n > res:
            res += 1
            n -= res
            #print res,n
        return res