day38

最新推荐文章于 2024-07-26 14:07:59 发布

乌拉！哒哒哒哒哒

最新推荐文章于 2024-07-26 14:07:59 发布

阅读量76

点赞数 2

分类专栏：代码随想录打卡记录文章标签：算法数据结构

本文链接：https://blog.csdn.net/sunke123456789/article/details/140071253

版权

代码随想录打卡记录专栏收录该内容

30 篇文章 0 订阅

订阅专栏

509
递归

class Solution {
public:
    int fib(int n) {
        if(n < 2){
            if(n == 1){
                return 1;
            }else{
                return 0;
            }
        }else{
            return fib(n-1) + fib(n-2);
        }
    }
};

class Solution {
public:
    int fib(int n) {
        if( n < 2){
            return n;
        }else{
            int dp[n+1];
            dp[0] = 0;
            dp[1] = 1;
            for(int i = 2; i <= n; i++){
                dp[i] = dp[i-1] + dp[i-2];
            }
            return dp[n];
        }
    }
};

class Solution {
public:
    int climbStairs(int n) {
        if (n <= 1) return n;
        int dp[3];
        dp[1] = 1;
        dp[2] = 2;
        for (int i = 3; i <= n; i++) {
            int sum = dp[1] + dp[2];
            dp[1] = dp[2];
            dp[2] = sum;
        }
        return dp[2];
    }
};

746

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        int result;
        int dp[2];
        dp[0] = 0;
        dp[1] = 0;
        for(int i = 2; i <= cost.size(); i++ ){
            result= min(dp[1] + cost[i - 1], dp[0] + cost[i-2]);
            dp[0] = dp[1];
            dp[1] = result;
        }
        return result;

    }
};