【动态规划】Leetcode编程题解：121. Best Time to Buy and Sell Stock Add to List

最新推荐文章于 2017-06-03 20:37:42 发布

w_t_youxi

最新推荐文章于 2017-06-03 20:37:42 发布

阅读量332

点赞数

分类专栏： Leetcode解题报告

本文链接：https://blog.csdn.net/w_t_youxi/article/details/71598621

版权

Leetcode解题报告专栏收录该内容

21 篇文章 0 订阅

订阅专栏

题目：

Say you have an array for which the i^th 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 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.

可以通过记录记录当前最小价格并且每次将现阶段价格减去最小价格得到差价，并且保留当前最大差价。

代码：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int minFar = INT_MAX;
        int maxFar = 0;
        for(int i = 0; i < prices.size(); i++) {
            minFar = min(minFar, prices[i]);
            maxFar = max(maxFar, prices[i] - minFar);
        }
        return maxFar;
    }
};

使用 Kadane's Algorithm

代码：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int maxPro = 0;
        int maxFar = 0;
        for(int i = 1; i < prices.size(); i++) {
            maxPro = max(0, maxPro += prices[i] - prices[i - 1]);
            maxFar = max(maxFar, maxPro);
        }
        return maxFar;
    }
};