(LeetCode)Arranging Coins --- 硬币排列

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 = 5The coins can form the following rows:¤¤ ¤¤ ¤Because the 3rd row is incomplete, we return 2.

Example 2:

n = 8The coins can form the following rows:¤¤ ¤¤ ¤ ¤¤ ¤Because the 4th row is incomplete, we return 3.

Subscribe to see which companies asked this question

解题分析：

对于此题目的解法有两种

基本暴力法

1、1+2+3+4+5...+K < N

数学解法

2、（1 + k）* k/2 = n

# -*- coding:utf-8 -*-__author__ = 'yx'class Solution(object):    def arrangeCoins(self, n):        res = 0        while n > res:            res += 1            n -= res        return res