代码随想录day41 121. 买卖股票的最佳时机 122.买卖股票的最佳时机II 123.买卖股票的最佳时机III
121. 买卖股票的最佳时机
代码随想录
class Solution {
public:int maxProfit(vector<int>& prices) {int size = prices.size();if (size == 1) {return 0;}vector<vector<int>> dp(size, vector<int>(2));dp[0][0] = 0;dp[0][1] = -prices[0];for (int i = 1; i < size; i++) {dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i]);dp[i][1] = max(dp[i - 1][1], -prices[i]);}return dp[size - 1][0];}
};
122. 买卖股票的最佳时机 II
代码随想录
class Solution {
public:int maxProfit(vector<int>& prices) {int size = prices.size();if (size == 1) {return 0;}vector<vector<int>> dp(size, vector<int>(2));dp[0][0] = 0;dp[0][1] = -prices[0];for (int i = 1; i < size; i++) {dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i]);dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] - prices[i]);}return dp[size - 1][0];}
};
123. 买卖股票的最佳时机 III
代码随想录
class Solution {
public:int maxProfit(vector<int>& prices) {int size = prices.size();if (size == 1) {return 0;}vector<vector<int>> dp(size, vector<int>(4, 0));dp[0][0] = -prices[0];dp[0][2] = -prices[0];for (int i = 1; i < size; i++) {dp[i][0] = max(dp[i - 1][0], -prices[i]);dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] + prices[i]);dp[i][2] = max(dp[i - 1][2], dp[i - 1][1] - prices[i]);dp[i][3] = max(dp[i - 1][3], dp[i - 1][2] + prices[i]);}return dp[size - 1][3];}
};
