LeetCode 122. 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 (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).

解法

贪心策略：在价格要升时买入，在价格要降时卖出。这样得到的一定是最大收益。如同在一个折线图中只截取了上升部分。算法复杂度为$O(n)$。

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int maxGain = 0, buying;
        bool purchased = false;    // 是否已有买入股票
        if (prices.size() == 0) {
            return maxGain;
        }
        for (int i = 0; i < prices.size() - 1; i++) {
            if (purchased && prices[i + 1] < prices[i]) { // 如果手持股票，但它下一刻会降价，那么卖出
                maxGain += prices[i] - buying;
                purchased = false;
            } else if (!purchased && prices[i + 1] > prices[i]) { // 如果没有手持股票，并且股票下一时刻会升值，那么买入
                buying = prices[i];
                purchased = true;
            }
        }
        if (purchased && prices.size() > 1) {
            maxGain += max(prices[prices.size() - 1], prices[prices.size() - 2]) - buying;
        }
        return maxGain;
    }
};