Say you have an array for which the i th
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) {
int profit = 0;
for(int i=1;i<prices.size();i++)
{
if(prices[i]-prices[i-1]>0)
profit += prices[i] - prices[i-1]; //股票可以无限次的交易，只要买在卖之前就行(贪心算法)
}
return profit;
}
};
