代码随想录day49|买卖股票

dp[i][0] 持有股票对应现金 i-1天持有状态vs当天买入
dp[i][1]没有股票对应现金 i-1天卖出状态 vs当天卖出
若可以多次买卖
dp[i][0] 持有股票对应现金 i-1天持有vs i-1天持有i天买入

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int len = prices.size();
        if (len==0) return 0;
        vector<vector<int>> dp(len,vector<int>(2));
        //0 for hold 1 for not hold
        dp[0][0] -= prices[0];
        dp[0][1] = 0;
        for (int i = 1; i < len; ++i) {
            dp[i][0] = max(dp[i-1][0], -prices[i]);
            dp[i][1] = max(dp[i-1][1], prices[i]+dp[i-1][0]);
        }
        return dp[len-1][1];
    }
};

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int len = prices.size();
        if (len==0) return 0;
        vector<vector<int>> dp(len,vector<int>(2));
        //0 for hold 1 for not hold
        dp[0][0] -= prices[0];
        dp[0][1] = 0;
        for (int i = 1; i < len; ++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]+dp[i-1][0]);
        }
        return dp[len-1][1];
    }
};