首页 > 代码库 > leetcode 70 Climbing Stairs ----- java
leetcode 70 Climbing Stairs ----- java
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?
还是简单的动态规划问题,很明显可以发现。
dp[i] = dp[i-2]+dp[i-1]
public class Solution { public int climbStairs(int n) { if( n == 0 ) return 0; if( n == 1) return 1; if( n == 2) return 2; int[] dp = new int[n]; dp[0] = 1; dp[1] = 2; for( int i = 2;i<n;i++){ dp[i] = dp[i-2]+dp[i-1]; } return dp[n-1];}}
leetcode 70 Climbing Stairs ----- java
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。