122 Best Time to Buy and Sell Stock II

1 题目

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.

2 尝试解

2.1 分析

股价每天在变，允许多次买卖，求问最大收益。只有有利可图就卖。最开始想法是维护一个最低股价，如果今天股价高于最低股价，能挣钱，就最低股价买入，今天股价卖出，最低股价更新为今天股价，即便以后有更高的股价，也只需要重新在今天再次买入即可。如果今天股价不超过最低股价，更新最低股价为今天股价。然后最低股价始终为前一天的股价。思路就可以简化为只需要看今天股价是否高于昨天股价，如果是算入收益部分即可。

2.2 代码

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

3 标准解

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