Leetcode 441. Arranging Coins

小白菜又菜

于 2024-10-13 00:59:04 发布

阅读量563

点赞数 10

分类专栏： Leetcode 解题报告入门题文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/mobius_strip/article/details/142892084

版权

解题报告同时被 3 个专栏收录

1380 篇文章 4 订阅

订阅专栏

入门题

302 篇文章 2 订阅

订阅专栏

Leetcode

161 篇文章 0 订阅

订阅专栏

Problem

You have n coins and you want to build a staircase with these coins. The staircase consists of k rows where the ith row has exactly i coins. The last row of the staircase may be incomplete.

Given the integer n, return the number of complete rows of the staircase you will build.

Algorithm

From 1 calculate the m where $\sum_{i=1}^m i \leq n < \sum_{i=1}^{m+1} i$ .

Code

class Solution:
    def arrangeCoins(self, n: int) -> int:
        ans, level = 0, 1
        while ans < n:
            if ans + level <= n:
                ans += level
            else:
                break
            level += 1
        return level-1