Method maxProfit

src/com/blankj/easy/_0122/Solution.java:13–19

(int[] prices)

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

    public static void main(String[] args) {
        Solution solution = new Solution();