LeetCode Stairs Problem Recursion Python

A simple TypeScript solution for the Climbing Stairs problem using an optimized loop.

To reach step N, you can come from step N-1 or step N-2. The total ways to reach step N is the sum of ways to reach the two previous steps.

一些您可能无法访问的结果已被隐去。