best-time-to-buy-and-sell-stock-ii

package com.ytx.array;

/**best-time-to-buy-and-sell-stock-ii

 *

 * 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).

 *

 * 买卖股票第二部，这次可以进行多次交易，买卖多次

 *

 * 思路：

 *   可以进行多次交易，其实就是求股票所有上涨区间的和

 *

 * @author yuantian xin

 *

 */

public class Best_time_to_buy_and_sell_stock_ii {

       

       public int maxProfit(int[] prices) {

             

             int len = prices.length;

             

             if(len == 0 || len == 1)  return 0;

             

             int maxProfit = 0;

             

             for(int i = 1; i < len; i++) {

                    

                    if(prices[i] <= prices[i - 1]) continue;

                    

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

             }

        return maxProfit;

    }

       public static void main(String[] args) {

       }

}