【leetcode】70. Climbing Stairs

一、题目描述

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?

题目解读：通过列出前几个可以找出规律，其实就是fibonacci序列

思路：动态定义一个大小为n的数组用来存每步的路线数

c++代码：（0ms）

class Solution {
public:
int climbStairs(int n) {
int* step=new int
;
if((n == 0) || (n == 1) || (n == 2))
return n;
else{
step[0]=1;
step[1]=2;
for(int i=2; i<n; i++)
step[i]=step[i-1]+step[i-2];
}
return step[n-1];

}
};