LeetCode_Best Time to Buy and Sell Stock

最新推荐文章于 2018-04-10 21:45:53 发布

原创最新推荐文章于 2018-04-10 21:45:53 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #leetcode #算法题

Something_Interesting 同时被 3 个专栏收录

174 篇文章

订阅专栏

C++

88 篇文章

订阅专栏

Leetcode

45 篇文章

订阅专栏

本文探讨了如何设计算法来最大化股票交易利润，仅允许完成一次买卖操作。通过将每日股票价格差值化，转化为最大子段和问题，提供了一种简便的解决方案。文章还分享了解题技巧、代码实现及个人体会。

一.题目

Best Time to Buy and Sell Stock

My Submissions

Total Accepted: 75747 Total Submissions: 221316 Difficulty: Medium

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

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

Have you met this question in a real interview?

Yes

Discuss

二.解题技巧

将每一天的股票价格减去前一天的股票价格，就可以将问题转化为求数组的最大子段和的问题，这样就可以用求解最大子段和的方法来解答。

三.实现代码

#include <iostream>
#include <vector>
#include <algorithm>


using namespace std;

class Solution
{
private:
int FindGreatestSumOfSubArray(vector<int>::const_iterator Begin,
                              vector<int>::const_iterator End)
    {
        // empty
        if (Begin == End)
        {
            return 0;
        }

        vector<int>::const_iterator Ite = Begin;
        int TmpResult_1 = 0;
        int TmpResult_2 = *Ite;
        int Sum = 0;
        while(Ite != End)
        {
            if (*Ite < 0)
            {
                if (Sum > TmpResult_1)
                {
                    TmpResult_1 = Sum;
                }
            }

            Sum += *Ite;
            if (Sum < 0)
            {
                Sum = 0;
            }

            if (*Ite > TmpResult_2)
            {
                TmpResult_2 = *Ite;
            }

            ++Ite;
        }

        if (TmpResult_2 < 0)
        {
            return 0;
        }

        if (Sum > TmpResult_1)
        {
            TmpResult_1 = Sum;
        }

        return TmpResult_1;
    }

public:
    int maxProfit(vector<int>& prices)
    {
        if (prices.empty())
        {
            return 0;
        }


        if (prices.size() == 1)
        {
            return 0;
        }

        for (vector<int>::iterator Ite = prices.begin(); Ite != prices.end() - 1;
             ++Ite)
        {
            *Ite = *(Ite + 1) - *Ite;
        }

        return FindGreatestSumOfSubArray(prices.begin(), prices.end() - 1);
    }

};