122. Best Time to Buy and Sell Stock II

Say you have an array for which the ith 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).

public class Solution {
    public int maxProfit(int[] prices) {
        int max=0;
        for(int i=0;i<prices.length-1;i++){
            int j=i+1;
                max=prices[j]-prices[i]+max>max?prices[j]-prices[i]+max:max;
            
        }
        return max;
    }
}

 将每两天的价格打包成块，因为只能先买后卖，不能买跌，只能买涨，那么只要保证这两天价格是涨的，那么就能保证全部收益，如果将股票价格画成曲线，就可以看到高点也是一步一步升上来的，不必找最低点和最高点，保证两天的时间间隔是盈利的，那么就是利益最大化