122. Best Time to Buy and Sell Stock II - jiejackyzhang/leetcode-note GitHub Wiki

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).

Array类题目。

array中的一组数是波动变化的，要获得max profit，应每次都在local min处买入，在local max处卖出。 因此凡是后一个数比前一个数大的，他们的差值就在max profit中。

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