We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 367d4da commit 4c3026cCopy full SHA for 4c3026c
climbing-stairs/bhyun-kim.py
@@ -34,6 +34,6 @@ def climbStairs(self, n: int) -> int:
34
output = 0
35
36
for i in range(n // 2 + 1):
37
- num_ways = factorials[n - i] / factorials[n - (i * 2)] / factorials[i]
+ num_ways = factorials[n - i] // factorials[n - (i * 2)] // factorials[i]
38
output += num_ways
39
return int(output)
0 commit comments