标签(空格分隔): leetcode dp
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. 你正在爬楼梯的情况。达到顶部需要n个台阶。
2. 每次你可以爬1或2步。你可以爬多少个不同的方式爬上去?
3. 注意:给定n将为正整数。
说明:
1. n= 1: way =1
2. n=2: way = 2
3. n =3: way = 3
4. n =: way = 5
5. ....
6. n = i: way = way(i-1) + way(i-2)
因此:
设置:
1. way(i-1): second
2. way(i-2) :first
3. way(i): sum = first + second
代码:
int climbStairs(int n) {
if (n == 1)
return 1;
if (n ==2)
return 2;
int first = 1;
int second = 2;
int sum = 0;
for (int i = 3; i <=n; ++i)
{
sum = first + second;
first = second;
second = sum;
//cout << "sum: " << sum << endl;
}
return sum;
}
【参考文档】
1.LeetCode(70) Climbing Stairs