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).
分析
依次寻找递增的区间，求最大值和最小值之差，然后相加即可。
int maxProfit(int* prices, int pricesSize) {
if(pricesSize<=1)return 0;
int profit=0;
int min=prices[0],max=prices[0];
for(int i=1;i<pricesSize;i++)
{
if(prices[i]>=max)max=prices[i];
else
{
profit+=max-min;
min=max=prices[i];
}
}
profit+=max-min;
return profit;
}
