_122.java

package com.fishercoder.solutions;

/**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 _122 {

    /**It turns out to be a super simple one, it's really a greedy one! Just keep being greedy if it's possible.*/
    public int maxProfit(int[] prices) {
        int pro = 0;
        for(int i = 0; i < prices.length-1; i++){
            if(prices[i+1] > prices[i]) pro += prices[i+1] - prices[i];
        }
        return pro;
    }

}