LeetCode-Best Time to Buy and Sell Stock III

最新推荐文章于 2024-10-10 22:59:02 发布

tymy

最新推荐文章于 2024-10-10 22:59:02 发布

阅读量551

点赞数

分类专栏： leetCode 文章标签： LeetCode IT面试 OJ 算法

本文链接：https://blog.csdn.net/u010266551/article/details/10027687

版权

leetCode 专栏收录该内容

123 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int  maxPrft = 0;
        if (prices.size() > 1)
        {
            vector<int> vec1(prices.size());
            vector<int> vec2(prices.size());
            vec1[0] = 0;
            int minVal = prices[0];
            for (int i = 1; i < prices.size(); ++i)
            {
                vec1[i] = max(vec1[i - 1], prices[i] - minVal);
                minVal = min(minVal, prices[i]);
            }
            vec2[vec2.size() - 1] = 0;
            int maxVal = prices[prices.size() - 1];
            for (int i = vec2.size() - 2; i >= 0; --i)
            {
                vec2[i] = max(vec2[i + 1], maxVal - prices[i]);
                maxVal = max(maxVal, prices[i]);
            }
            maxPrft = vec2[0];
            for (int i = 0; i < vec1.size() - 1; ++i)
            {
                maxPrft = max(maxPrft, vec1[i] + vec2[i + 1]);
            }
        }
        return maxPrft;
    }
};