Java for Leetcode 122 best time to Buy and Sell Stock II

Say you has 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 could complete as many transactions as (ie, buy one and sell one share of the stock multiple times). However, engage in multiple transactions for the same time (ie, you must sell the stock before you buy again).

Problem Solving Ideas:

In the case of the previous problem, if the traverse is dropped, that is, sell and the buy is set to the drop point, the Java implementation is as follows:

    public int Maxprofit (int[] prices) {        if (prices.length==0)    return 0;        int buy = 0,profit = 0;        for (int i = 1; i < prices.length; ++i) {            if (Prices[i-1] > Prices[i]) {                PROFIT+=PRICES[I-1]-PRICES[BUY];
  buy = i;            }        }        Profit+=prices[prices.length-1]-prices[buy];        return profit;    }

Java for Leetcode 122 best time to Buy and Sell Stock II