Skip to content

Commit cc5824e

Browse files
authored
Solution Climbing Stairs
1 parent acd7746 commit cc5824e

File tree

1 file changed

+26
-0
lines changed

1 file changed

+26
-0
lines changed

β€Žclimbing-stairs/river20s.java

Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
/*
2+
* 풀이: n번째 계단에 λ„λ‹¬ν•˜λŠ” κ²½μš°λŠ” λ‹€μŒ 두 κ°€μ§€λ‘œ λ‚˜λ‰œλ‹€.
3+
* 1. (n-1)번째 κ³„λ‹¨μ—μ„œ ν•œ 계단 였λ₯΄λŠ” 경우
4+
* 2. (n-2)번째 κ³„λ‹¨μ—μ„œ 두 계단 였λ₯΄λŠ” 경우
5+
* λ”°λΌμ„œ, n개의 계단을 μ˜¬λΌκ°€λŠ” λ°©λ²•μ˜ 경우의 수 F(n)은
6+
* F(n-1)κ³Ό F(n-2)의 ν•©κ³Ό κ°™λ‹€.
7+
* μ‹œκ°„ λ³΅μž‘λ„: O(n)
8+
* 곡간 λ³΅μž‘λ„: O(1)
9+
*/
10+
class Solution {
11+
public int climbStairs(int n) {
12+
if(n == 1) return 1;
13+
14+
int step1 = 1;
15+
int step2 = 2;
16+
17+
for (int i = 3; i <= n; i++) {
18+
int temp = step1 + step2;
19+
step1 = step2;
20+
step2 = temp;
21+
}
22+
23+
return step2;
24+
}
25+
}
26+

0 commit comments

Comments
Β (0)