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的就是盈利
class Solution {
public int maxProfit(int[] prices) {
int result = 0;
for(int i = 0; i < prices.length - 1; i++)
{
if(prices[i+1] - prices[i] > 0)
result += prices[i+1] - prices[i];
}
return result;
}
}