我敢保证这道题是在今早蹲厕所的时候突然冒出的解法.第一次接触DP题,我好伟大啊啊啊~ 题目:一个N阶的梯子,一次能够走1步或者2步,问有多少种走法. 解法:原始DP问题. 思路: 1.if N == 1 , then ans = 1; 2.if N == 2 , then ans = 2; 3.if 我们现在在N-1阶处,现在已经有f(N-1)种走法,那么到N阶处,则还是f(N - 1)种走法(再走一步到终点). 4.if 我们现在在N-2阶处,现在已经有f(N-2)种走法,那么到N阶处,则还是…

水的问题. 以为很常见.青蛙跳楼梯.能跳一步可以跳两步,它实际上是一个斐波那契数. 注意.空间O(1). class Solution { public: int climbStairs(int n) { int left = 1, right = 2; if(n<=2) return n; int res; for(int i=0;i<n-2;i++){ res = left+right; left = right; right = res; } return res; } }; 版权声明:…

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…

Climbing Stairs https://oj.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? 这题比较简单,可以使用动态规划来求解…

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? 原题链接:https://oj.leetcode.com/problems/climbing-stairs/ 题目:你在爬楼梯. 须要 n 步才干到顶部. 每次你爬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? 算法1:分析:dp[i]为爬到第i个台阶需要的步数,那么dp[i] = dp[i-1] + dp[i-2], 很容易看出来这是斐波那契数列的公式       …

class Solution(object): def climbStairs(self, n): """ :type n: int :rtype: int """ if n <= 2: return n last =1 nexttolast = 1 sums = 0 for i in range(2,n+1): sums = last+nexttolast nexttolast = last last = sums return sums…

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阶楼梯,每次可以走一步或者两步,总共有多少种方法. 思路:动态规划.维护一个一维数组dp[n+1],dp[0]为n=0时的情况,dp[ i ]为到达第i阶台阶…

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? Show Tags     这题其实就是斐波那契数列来的. #include <iostream> using namespace std; class Soluti…