[href.] https://leetcode.com/problems/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.

@@ -1,334 +1,282 @@
-%5Bhref.%5D https://leetcode.com/problems/arranging-coins/%0A%0AYou 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.%0A%0AGiven n, find the total number of full staircase rows that can be formed.%0A%0An is a non-negative integer and fits within the range of a 32-bit signed integer.
+class Solution(object):%0A    def arrangeCoins(self, n):%0A        %22%22%22%0A        :type n: int%0A        :rtype: int%0A        %22%22%22%0A        x   = n%0A        y   = 1%0A        cnt = 0%0A    %0A        while y %3C= x:%0A            x   -= y%0A            y   += 1%0A            cnt += 1%0A    %0A        return cnt
 %0A

Update solution.py