## 题目

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:

1 | n = 5 |

Example 2:

1 | n = 8 |

## 思路

Math.

## 代码

1 | class Solution(object): |