Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 70 with 17 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 70 # by problem number
lcpy gen -s climbing_stairs # by problem name
n steps to reach the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Input: n = 2
Output: 2
Input: n = 3
Output: 3
class Solution:
# Time: O(n)
# Space: O(1)
# This follows Fibonacci pattern
# Standard Fib: F(0)=0, F(1)=1, F(2)=1, F(3)=2, F(4)=3, F(5)=5...
def climb_stairs(self, n: int) -> int:
if n <= 2:
return n
prev2, prev1 = 1, 2
for _ in range(3, n + 1):
current = prev1 + prev2
prev2, prev1 = prev1, current
return prev1
| Time | Space |
|---|---|
| O(n) | O(1) |