这道题参考了这个网址: http://blog.csdn.net/u012490475/article/details/48845683 /* 首先考虑边界情况,当有1层时,有一种方法. 然后再看2层时,有1+1.和2+0,两种方法. 再看3层时,首先有两种选择:走一步或者走两步. 如果走两步,那后面还剩一步可走: 如果走一步,后面还剩两步可走,后面的方法即可等同于上面的2层情况. 即可归纳出用C(i) = j; 表示n层时有j种可能. C(1) = 1; C(2) = 2; C(3) = C(…

Description 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? Example Given an example n=3 , 1+1+1=2+1=1+2=3 return 3 又是一道动态规划类的题目,马上做…

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? Have you met this question in a real interview? Yes Example Given an example n=3 , 1…

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或2步,那…

July 28, 2015 Problem statement: 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? The problem is most popular question in the algorit…

Search a 2D Matrix Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted from left to right. The first integer of each row is greater than the last integer…

Climbing Stairs https://leetcode.com/problems/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? 算法描述 (1)这道题其实是一道fibon…

原题 Climbing Stairs 求斐波那契数列的第N项,开始想用通项公式求解,其实一个O(n)就搞定了. class Solution { public: int climbStairs(int n) { ) ; ; ; ; i<n; ++i) { int t = n2; n2 = n1 + n2; n1 = t; } return n2; } }; 还是觉得没有ACM难度,继续做吧.…

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? 思路:题目也比較简单.类似斐波那契. 代码例如以下: public class Solution { public int climb…

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步到达楼梯的顶部.每一次你只能上一个或两级台阶,问要到达顶部一共有多少种方法? 解题思路: 真是太巧了!!我…