Leetcode 122. best time to Buy and Sell Stock II Java language

Say you had an array for which the ith element was the price of a given stock on day i.design an algorithm to find the max Imum 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).

Test instructions: Stock buy and sell. But you can buy and sell multiple times. But make sure there is no stock in your hand when you buy.

Public class solution {    public int maxprofit (int[] prices )  {        if (prices==null | | &NBSP;PRICES.LENGTH&LT;2) return 0;        int buy=prices[0];         int sum=0;         for (int i=1;i<prices.length;i++) {             if (prices[i]>buy) {                 sum+=prices[i]-buy;                 buy=prices[i];             }else{                 buy=prices[i];            }        }         return sum;    }}

Leetcode 122. best time to Buy and Sell Stock II Java language