Best Time to Buy and Sell Stock II

Say you have 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 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) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int max = 0;
        for(int i = 0; i < prices.length - 1; i ++){
            max = ((prices[i + 1] - prices[i] > 0) ? (prices[i + 1] - prices[i] + max): max);
        }
        return max;
    }
}