LeetCode 30天挑战 Day-5

LeetCode 30 days Challenge - Day 5

本系列将对LeetCode新推出的30天算法挑战进行总结记录，旨在记录学习成果、方便未来查阅，同时望为广大网友提供帮助。

---

Best Time to Buy and Sell Stock II

Say you have an array for which the ith 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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

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

---

Solution

题目要求分析：给定一个整型数组，记录着若干天股票的价格，进行任意次买入卖出（买入后必须先卖出再进行下一次买入），求最大利润。

解法：

本题是股票的买卖时机系列的第二题，问题关键在于理解：

1. 对于多日连续上升的情况，每日都进行一次买入卖出等价于最低日买入、最高日卖出；

   在下图中，注意：A + B + C = D

   

2. 对于两次连续的谷底、峰值情况，每次都进行买入、卖出会优于只进行一次买入、卖出；

   在下图中，注意：A + B > C

   

理解了以上两种情况，就能推导出最佳情况实际上就是逐日进行检查，当每日价格高于前一天时，就能盈利。

---

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

---

传送门：Best Time to Buy and Sell Stock II

2020/4 Karl