70. Climbing Stairs - easy
문제
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Note: Given n will be a positive integer.
제한사항
입출력 예
1
2
3
4
5
6
7
Example 1:
Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps
1
2
3
4
5
6
7
8
Example 2:
Input: 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
풀이
- DP
1
2
3
4
5
6
7
8
9
10
11
12
func climbStairs(n int) int {
item := make([]int, n + 1)
item[0] = 1
item[1] = 1
for i := 2 ; i <= n ; i += 1 {
item[i] = item[i-1] + item[i-2]
}
return item[n]
}