zoukankan      html  css  js  c++  java
  • [leetcode] 70. 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?

    Note: Given n will be a positive integer.

    1.递归(超时)

    public int climbStairs(int n) {
            if (n<=0) return 0;
            if (n==1) return 1;
            if (n==2) return 2;
            return climbStairs(n-1)+climbStairs(n-2);
        }

    2.动态规划

    public int climbStairs(int n) {
            if (n == 0 || n == 1 || n == 2) return n;
            int[] dp = new int[n + 1];
            dp[0] = 0;
            dp[1] = 1;
            dp[2] = 2;
            for (int i = 3; i <= n; i++) {
                dp[i] = dp[i - 1] + dp[i - 2];
            }
            return dp[n];
        }
  • 相关阅读:
    怎样装两个MySQL服务器
    MySQL 8.0.12的安装与卸载
    位运算符2
    位运算符
    赋值运算符
    love心形
    变量之间运算
    变量
    标识符
    算术运算符
  • 原文地址:https://www.cnblogs.com/pulusite/p/7599520.html
Copyright © 2011-2022 走看看