Clumsy Factorial LeetCode solution in Python

1
# Runtime: 87 ms (Top 67.15%) | Memory: 13.9 MB (Top 59.65%)
2
class Solution:
3
    def clumsy(self, n: int) -> int:
4
        if n > 2:
5
            sum = n * (n - 1) // (n - 2) + (n - 3)
6
        else:
7
            sum = n
8
        for i in range(n - 4, 0, -4):
9
            if i < 3:
10
                sum = sum - i
11
                break
12
            sum = sum - (i) * (i - 1) // (i - 2) + (i - 3)
13

14
        return sum