题目·:
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).
解析:
本题是意思将所得利润最大化,只要将每次买入卖出所得的收入最大化,如果一次买入卖出后得到的收入大于0,则将最终结果加上收入,若小于,则不进行此交易即结果不加也不减,直到最后一次交易完成。
代码:
int maxProfit(vector<int> &prices) {
int result = 0;
for (int i = 1; i < prices.size(); ++i)
result += max(prices[i] - prices[i - 1], 0);
return result;
}