算法60天：day49

动态规划-买卖股票的最佳时机

力扣链接

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int len = prices.size();
        if(len == 1) return 0;
        vector<vector<int>> dp(len,vector<int>(2));
        //dp[i][0] 表示第i天持有股票所得最多现金  dp[i][0] = max(dp[i - 1][0], -prices[i]);
        //dp[i][1] 表示第i天不持有股票所得最多现金  dp[i][1] = max(dp[i - 1][1], prices[i] + dp[i - 1][0]);
        //初始化
        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];
    }
};

动态规划-买卖股票的最佳时机 II

力扣链接

/*贪心算法
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int result = 0;
        int count = 0;
        for(int i = 0; i < prices.size() - 1; i++){
            count = prices[i + 1] - prices[i];
            if(count > 0) result += count;
        }
        return result;
    }
};
*/
//动态规划
class Solution {
public:
    int maxProfit(vector<int>& prices) {
       int len = prices.size();
        if(len == 1) return 0;
        vector<vector<int>> dp(len,vector<int>(2));
        //dp[i][0] 表示第i天持有股票所得最多现金  dp[i][0] = max(dp[i - 1][0],dp[i - 1][1] -prices[i]);
        //dp[i][1] 表示第i天不持有股票所得最多现金  dp[i][1] = max(dp[i - 1][1], prices[i] + dp[i - 1][0]);
        //初始化
        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];
    }
};