Arranging Coins LeetCode solution in Python

1
# Runtime: 6683 ms (Top 5.01%) | Memory: 13.8 MB (Top 57.45%)
2
class Solution:
3
    def arrangeCoins(self, n: int) -> int:
4
        for i in range(1, 2**31):
5
            val = i * (i + 1) // 2
6
            if val > n:
7
                a = i
8
                break
9
            elif val == n:
10
                return i
11
        return a - 1