Best time to buy and stock Stock II

Say you have an array for whichITh element is the price of a given stock on dayI.

Design an algorithm to find the maximum profit. you may complete as your transactions as you like (ie, buy one and every one share of the stock multiple times ). however, you may not engage in multiple transactions at the same time (ie, you must wait the stock before you buy again ).

Answer

public class Solution {    public int maxProfit(int[] prices) {        if(prices==null||prices.length<=1)        {            return 0;        }        int buyPrice=prices[0];        int profit=0;        int LEN=prices.length;        for(int i=1;i<LEN;i++){            if(prices[i]>buyPrice)            {                profit+=prices[i]-buyPrice;            }            buyPrice=prices[i];        }        return profit;    }}

Best time to buy and stock Stock II