Java [Leetcode 122]best time to Buy and Sell Stock II

Title Description:

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:

When the day after tomorrow is higher, the difference is added, and the cumulative sum is added and the result is finally obtained.

The code is as follows:

public class Solution {public    int maxprofit (int[] prices) {    int res = 0;    for (int i = 0; i < prices.length-1; i++) {    if (Prices[i] <= prices[i + 1])    res + = (prices[i + 1]-prices[i] );    }    return res;    }      }

　　

Java [Leetcode 122]best time to Buy and Sell Stock II