程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> LeetCode70——Climbing Stairs

LeetCode70——Climbing Stairs

編輯:C++入門知識

LeetCode70——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?

難度系數:

容易

實現

int climbStairs(int n) {
    if (n <= 2) {
        return n;
    } else {
        int *step = new int[n+1];
        step[1] = 1;
        step[2] = 2;
        for (int i = 3; i <= n; ++i) {
            step[i] = step[i-1] + step[i-2];
        }
        int tmp = step[n];
        delete step;
        return tmp;
    }   
}

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved