122. Best Time to Buy and Sell Stock II

    Say you have an array forwhich the ith element is the price of a given stock on day i.

Design an algorithm to findthe maximum profit. You may complete as many transactions as you like (ie, buyone and sell one share of the stock multiple times). However, you may notengage in multiple transactions at the same time (ie, you must sell the stockbefore you buy again).

    翻译:这题上面一个题目的变体，不难。意思是数组的每个数字都代表每天的股价，可以无限的买和卖。但在买股票之前，必须把其他的卖掉。计算能够获得的最大利润。代码如下：

public class Solution {

    public int maxProfit(int[] prices) {

        if(prices.length==0) return 0;

          intresult=0;

          for(inti=1;i<prices.length;i++){

               if(prices[i-1]<prices[i]){

                     result+=prices[i]-prices[i-1];

                }

          }

          return result;

    }

}