Best Time to Buy and Sell Stock I&II

最新推荐文章于 2018-01-12 20:39:55 发布

Liluyuan5323

最新推荐文章于 2018-01-12 20:39:55 发布

阅读量188

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Liluyuan5323/article/details/79046501

版权

LeetCode 专栏收录该内容

70 篇文章 0 订阅

订阅专栏

121. Best Time to Buy and Sell Stock

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.

可用动态规划法，从前向后遍历数组，记录当前出现过的最低价格，作为买入价格，并计算以当天价格出售的收益，作为可能的最大收益，整个遍历过程中，出现过的最大收益就是所求。

代码：

int maxProfit(vector<int>& prices) {
        int minPrice = INT_MAX;
        int maxProfit = 0;
        for (int i = 0; i < prices.size(); i++) {
            if (prices[i] < minPrice) {
                minPrice = prices[i]; 
            }
            int todayProfit = prices[i] - minPrice;
            if (todayProfit > maxProfit) {
                maxProfit = todayProfit;
            }
        }
        return maxProfit;
    }

122. Best Time to Buy and Sell Stock II

Say you have an array for which the $i^{th}$ element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

这道题规定可以进行多次不重叠的交易（当天也可以先卖后买），使用贪心算法，只要当天的价格高于前一天的价格，就算入收益。

代码：

int maxProfit(vector<int>& prices) {
        if (prices.size() <= 1) return 0;
        int max = 0;
        for (int i = 1; i < prices.size(); i++) {
            if (prices[i] >= prices[i-1]) {
                max += prices[i] - prices[i-1];
            }
        }
        return max;
    }