HomeClimbing Stairs
Page 1 of 1
Climbing Stairs
by Admin Sat Oct 21, 2017 4:58 pm
int climbStairs(int n) {
int f1 = 2;
int f2 = 1;
if(n == 1) {
return f2;
} else if(n == 2) {
return f1;
}
int fn=0;
for(int i = 3; i <= n; i++) {
fn = f1 + f2;
f2 = f1;
f1 = fn;
}
return fn;
}
int f1 = 2;
int f2 = 1;
if(n == 1) {
return f2;
} else if(n == 2) {
return f1;
}
int fn=0;
for(int i = 3; i <= n; i++) {
fn = f1 + f2;
f2 = f1;
f1 = fn;
}
return fn;
}
Admin- Admin
- Posts : 124
Join date : 2017-10-21 -
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum|
|
|