Leetcode: 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 profit = 0;
        if (prices.length == 0 || prices.length == 1) return profit;
        for (int i = 1; i < prices.length; i++) {
            if (prices[i] <= prices[i-1]) continue;
            else {
                profit += prices[i] - prices[i-1];
            }
        }
        return profit;
    }
}