题目:
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).
class Solution {
public:
//可以交易任意多次单不能同时拥有多于一支股票
//只要将所有的有增长的地方获得的利润加起来即可
int maxProfit(vector<int>& prices) {
if (prices.empty()) return 0;
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;
}
};