LeetCode122.买卖股票的最佳时机II（动态规划）

class Solution {
public:int maxProfit(vector<int>& prices) {vector<vector<int>> dp(prices.size(), vector<int>(2, 0));//dp[i][0]，即第i天不持有股票//dp[i][1]，即第i天持有股票dp[0][0] = 0;dp[0][1] = -prices[0];int maxProfit = 0;for (int i = 1; i < prices.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][0] - prices[i]);int tempMax = max(dp[i][0], dp[i][1]);maxProfit = max(maxProfit, tempMax);}return maxProfit;}
};