百度收录最新方法_百度入口网页版_seo百度首页排名业务_免费拓客软件排行榜

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\le n<{\sum }_{i=1}^{m+1}i$.

Code

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