climbing-stairs

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are climbing a staircase. It takes <code>n</code> steps to reach the top.

Each time you can either climb <code>1</code> or <code>2</code> steps. In how many distinct ways can you climb to the top?

&nbsp;
Example 1:

<pre>
Input: n = 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps
</pre>

Example 2:

<pre>
Input: n = 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 45</code></li>
</ul>

climbStairs

Climbing Stairs

Min Cost Climbing Stairs

min-cost-climbing-stairs

使用最小花费爬楼梯

Fibonacci Number

fibonacci-number

斐波那契数

N-th Tribonacci Number

n-th-tribonacci-number

第 N 个泰波那契数

Minimum Rounds to Complete All Tasks

minimum-rounds-to-complete-all-tasks

完成所有任务需要的最少轮数

Count Number of Ways to Place Houses

count-number-of-ways-to-place-houses

统计放置房子的方式数

Number of Ways to Reach a Position After Exactly k Steps

number-of-ways-to-reach-a-position-after-exactly-k-steps

恰好移动 k 步到达某一位置的方法数目

Count Ways To Build Good Strings

count-ways-to-build-good-strings

统计构造好字符串的方案数

Frog Jump II

frog-jump-ii

青蛙过河 II

Find Number of Ways to Reach the K-th Stair

find-number-of-ways-to-reach-the-k-th-stair

到达第 K 级台阶的方案数

The Number of Ways to Make the Sum

the-number-of-ways-to-make-the-sum

达到总和的方法数量

Memoization

Math

Dynamic Programming

假设你正在爬楼梯。需要 <code>n</code>&nbsp;阶你才能到达楼顶。

每次你可以爬 <code>1</code> 或 <code>2</code> 个台阶。你有多少种不同的方法可以爬到楼顶呢？

&nbsp;

示例 1：

<pre>
输入：n = 2
输出：2
解释：有两种方法可以爬到楼顶。
1. 1 阶 + 1 阶
2. 2 阶</pre>

示例 2：

<pre>
输入：n = 3
输出：3
解释：有三种方法可以爬到楼顶。
1. 1 阶 + 1 阶 + 1 阶
2. 1 阶 + 2 阶
3. 2 阶 + 1 阶
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 45</code></li>
</ul>