441 排列硬币

You have a total of n coins that you want to form in a staircase shape, where everyk-th row must have exactlyk 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.
题意
你一共有n个硬币，你需要将其摆成阶梯的形状，在这个阶梯中 第 k行 一定要有 k个硬币。

给定一个n，找出可以形成的完整阶梯的总数。

n是一个非负整数，在带符号的32位整数范围内。

思路：等差数列，第一行1个硬币，第二行2个硬币，第k行k个硬币，总共有S=（k+1）k/2<=n

import math
class Solution(object):
    def arrangeCoins(self, n):
        """
        :type n: int
        :rtype: int
        """
        return int((math.sqrt(8*n+1)-1)/2)