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).
假设你有一个数组，数组中第i个元素是给定股票在第i天的价格。
设计一个算法来得到最大利润。交易的次数没有限制（可买入再卖出多次）。但是，不能同时参与超过一次交易（再次买入之前需把现有股票卖出）。
代码参考了discuss中的高票答案，是我自己想复杂了，一直想找到何时买入何时卖出，其实并不需要
class Solution {
public int maxProfit(int[] prices) {
int max=0;
for(int i=1;i<prices.length;i++) {
if(prices[i]>prices[i-1])
max=max+(prices[i]-prices[i-1]);
}
return max;
}
}