zoukankan      html  css  js  c++  java
  • 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.

    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

     1 class Solution {
     2     public int climbStairs(int n) {
     3         int []dp = new int[n + 1];
     4         dp[0] = 1;
     5         dp[1] = 2;
     6         for (int i = 2; i < n; ++i) {
     7             dp[i] = dp[i - 2] + dp[i - 1];
     8         }
     9         return dp[n - 1];
    10     }
    11 }
  • 相关阅读:
    qq
    qqq
    q
    .json文件
    q
    q
    q
    找jar包的网址
    1qq
    day18(JDBC事务&连接池介绍&DBUtils工具介绍&BaseServlet作用)
  • 原文地址:https://www.cnblogs.com/hyxsolitude/p/12324126.html
Copyright © 2011-2022 走看看