代码随想录训练营第三十八天|LeetCode 509、70、746

LeetCode 509斐波那契数

题目链接：509.斐波那契数

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

LeetCode 70爬楼梯

题目链接：70.爬楼梯

class Solution {
public:
	int climbStairs(int n) {
		if (n < 3) return n;
		vector<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];
	}
};

LeetCode 746使用最小花费爬楼梯

题目链接：746.使用最小花费爬楼梯

class Solution {
public:
	int minCostClimbingStairs(vector<int>& cost) {
		//题目中2 <= cost.length <= 1000
		vector<int> dp(cost.size());//表示从第i个台阶向上爬需要的花费
		dp[0] = cost[0];
		dp[1] = cost[1];
		for (int i = 2; i < cost.size(); ++i) {
			dp[i] = min(dp[i - 1], dp[i - 2]) + cost[i];
		} 
		return min(dp[cost.size() - 1], dp[cost.size() - 2]);
	}
};