We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://februarysea.com/2020/02/06/70-Climbing-Stairs/
####题目描述 假设你正在爬楼梯。需要 n 阶你才能到达楼顶。 每次你可以爬 1 或 2 个台阶。你有多少种不同的方法可以爬到楼顶呢？ 注意：给定 n 是一个正整数。 示例 1： 123456输入： 2输出： 2解释： 有两种方法可以爬到楼顶。1. 1 阶 + 1 阶2. 2 阶 示例 2： 1234567输入： 3输出： 3解释： 有三种方法可以爬到楼顶。1. 1 阶 + 1 阶 +
The text was updated successfully, but these errors were encountered:
No branches or pull requests
https://februarysea.com/2020/02/06/70-Climbing-Stairs/
####题目描述 假设你正在爬楼梯。需要 n 阶你才能到达楼顶。 每次你可以爬 1 或 2 个台阶。你有多少种不同的方法可以爬到楼顶呢？ 注意：给定 n 是一个正整数。 示例 1： 123456输入： 2输出： 2解释： 有两种方法可以爬到楼顶。1. 1 阶 + 1 阶2. 2 阶 示例 2： 1234567输入： 3输出： 3解释： 有三种方法可以爬到楼顶。1. 1 阶 + 1 阶 +
The text was updated successfully, but these errors were encountered: