算法分析与设计week16--121. Best Time to Buy and Sell Stock

chenxy258

于 2018-01-13 07:36:39 发布

阅读量214

点赞数

CC 4.0 BY-SA版权

分类专栏：算法设计与分析作业

本文链接：https://blog.youkuaiyun.com/chenxy258/article/details/79049228

算法设计与分析作业专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种寻找股票买卖最佳时机以获得最大利润的算法。该算法只需遍历一次价格数组，通过记录最低购买价格并计算当前价格与最低购买价格之差作为潜在利润，从而找出最大利润。

121. Best Time to Buy and Sell Stock

Description

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.

Example

Example 1:
Input: [7, 1, 5, 3, 6, 4]
Output: 5
max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)

Example 2:
Input: [7, 6, 4, 3, 1]
Output: 0
In this case, no transaction is done, i.e. max profit = 0.

Analysis

只需要遍历一次数组，用一个变量记录遍历过数中的最小值，然后每次计算当前值和这个最小值之间的差值最为利润，然后每次选较大的利润来更新。当遍历完成后当前利润即为所求。

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

        int max_profit = 0, buy = INT_MAX;

        for (int i = 0; i < prices.size(); i++) {
            buy = min(prices[i], buy);
            max_profit = max(prices[i] - buy, max_profit);
        }

        return max_profit;
    }
};