# 原地址
https://leetcode-cn.com/problems/climbing-stairs/submissions/
# 分析
最简单的dp问题
f(n)=f(n-1)+f(n-2),不做过多解释。。
# 代码
```java
class Solution {
public int climbStairs(int n) {
if (n == 1) {
return 1;
}
if (n == 2) {
return 2;
}
int[] dp = new int[n];
dp[0] = 1;
dp[1] = 2;
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n - 1];
}
}
```

70. 爬楼梯