LeetCode - 123. Best Time to Buy and Sell Stock III - 思路详解 - C++

最新推荐文章于 2021-02-18 12:21:44 发布

知无畏

最新推荐文章于 2021-02-18 12:21:44 发布

阅读量307

点赞数

分类专栏： LeetCode 算法 C++ 数组动态规划

本文链接：https://blog.csdn.net/SJWL2012/article/details/54585558

版权

C++ 同时被 3 个专栏收录

53 篇文章 0 订阅

订阅专栏

LeetCode

48 篇文章 0 订阅

订阅专栏

算法

43 篇文章 0 订阅

订阅专栏

题目

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete at most two transactions.

翻译

假设一个数组，表示第i天的股票价格。设计算法，求出最大收益，最多可以进行两次交易

思路

代码

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int res = 0;
        int len = prices.size();
        if(len <= 0){
            return 0;
        }
        vector<int> left(len,0);
        vector<int> right(len,0);
        maxProfitLeft(prices,left);
        maxProfitRight(prices,right);
        for(int i = 0; i < len; i++){
            int l = left[i];
            int r = i+1 < len ? right[i+1]:0; 
            int t = l+r;
            if(t > res){
                res = t;
            }
        }
        return res;
    }


    //采用 Best Time to Buy and Sell Stock I
    void maxProfitLeft(vector<int> &prices,vector<int> &left){
        int buyPrice = prices[0];
        int max = 0;
        for(int i = 0; i < prices.size(); i ++ ){
            if(prices[i] < buyPrice){
                buyPrice = prices[i];
            }else{
                int p = prices[i] - buyPrice;
                if(p > max){
                    max = p;
                }
            }

            left[i] = max;
        }
    }

     //采用 Best Time to Buy and Sell Stock I
    void maxProfitRight(vector<int> &prices,vector<int> &right){
        int sellPrice = prices[prices.size()-1];
        int max = 0;
        for(int i = prices.size()-1; i >= 0; i -- ){
            if(prices[i] > sellPrice){
                sellPrice = prices[i];
            }else{
                int p = sellPrice - prices[i];
                if(p > max){
                    max = p;
                }
            }

            right[i] = max;
        }
    }
};