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?

分析：考虑走第n步时的情况，可以从第n-1个台阶走一步，也可以从第n-2个台阶走两步。即f(n) = f(n-1) + f(n-2)，同时f(1) = 1, f(2) = 2.

1. 使用递归，结果超时了。

class Solution {
public:int climbStairs(int n) {if(n == 1) return 1;if(n == 2) return 2;else return(climbStairs(n-1) + climbStairs(n-2));}
};

View Code

2. 和斐波那契亚数列差不多，于是用了for循环来代替，2ms。

 1 class Solution {
 2 public:
 3     int climbStairs(int n) {
 4         if(n <= 2) return n;
 5
 6         int *result = new int[n];
 7         result[0] = 1;
 8         result[1] = 2;
 9         for(int i = 2; i < n; i++)
10             result[i] = result[i-1] + result[i-2];
11
12         return result[n-1];
13     }
14 };

转载于:https://www.cnblogs.com/amazingzoe/p/4442650.html

Climbing Stairs相关推荐

70. Climbing Stairs
70. Climbing Stairs 1. 题目 You are climbing a stair case. It takes n steps to reach to the top. Each ...
爬楼梯 · Climbing Stairs
［抄题］: 假设你正在爬楼梯,需要n步你才能到达顶部.但每次你只能爬一步或者两步,你能有多少种不同的方法爬到楼顶部? ［思维问题］: 不知道一步.两步怎么加.还是用iteration迭代.此题公式可被 ...
【动态规划斐波那切数列】LeetCode 746. Min Cost Climbing Stairs
LeetCode 746. Min Cost Climbing Stairs 本博客转载自:http://www.cnblogs.com/grandyang/p/8343874.html 存在无代价的 ...
【斐波那切数列】LeetCode 70. Climbing Stairs
LeetCode 70. Climbing Stairs 这是一道利用斐波那切数列求解的题目.求斐波那切数列有比较经典的4种方法 (1)递归法:复杂度太高 (2)迭代法:时间复杂度为O(n)O(n)O ...
算法:Climbing Stairs(爬楼梯) 6种解法
说明算法:Climbing Stairs(爬楼梯) LeetCode地址:https://leetcode.com/problems/climbing-stairs/ 题目: You are cli ...
[勇者闯LeetCode] 70. Climbing Stairs
[勇者闯LeetCode] 70. Climbing Stairs Description You are climbing a stair case. It takes n steps to rea ...
10.2 动态规划算法套路及空间优化 —— Climbing Stairs Unique Paths
这一篇文章从最简单的动态规划题目开始,结合上一节动态规划三要素,以LeetCode两道基础的DP题目阐述DP问题的基本套路解法. 70. Climbing Stairs You are climbin ...
[LeetCode]70.Climbing Stairs
[题目] You are climbing a stair case. It takes n steps to reach to the top. Each time you can either c ...
LeetCode Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb ...
LeetCode Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb ...

Climbing Stairs

Climbing Stairs相关推荐

最新文章

热门文章