LeetCode.70：Climbing Stairs【DP】

最新推荐文章于 2023-06-21 00:56:53 发布

RyanWang0000

最新推荐文章于 2023-06-21 00:56:53 发布

阅读量94

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/qq_32350719/article/details/89494189

版权

LeetCode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

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?

Note: Given n will be a positive integer.

Example 1:

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

思路：dp[i]表示到达第i个台阶的方法数
到达第i个台阶的方法：
1. 从第i-1个台阶走一步
2. 从第i-2个台阶走两步
所以，到达第i个台阶的方法数=到达第i-1个台阶的方法数＋到达第i-2个台阶的方法数
即dp[i]=dp[i−1]+dp[i−2]

package com.Ryan;

public class ClimbingStairs {

	public static void main(String[] args) {
		ClimbingStairs climbingStairs=new ClimbingStairs();
		int n=3;
		System.out.println(climbingStairs.climbStairs(n));
	}
	public int climbStairs(int n) {
		if (n<=1) {
			return 1;
		}
		int dp[]=new int[n+1];
		dp[1]=1;
		dp[2]=2;
		for (int i = 3; i <= n; i++) {
			dp[i]=dp[i-1]+dp[i-2];
		}
		
		return dp[n];
        
    }
}