Leetcode122 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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

中文题意

其实这道题目的英文原题中没有将问题讲述清楚，而且所给的三个例子也不是很好，所以开始理解题目的时候，认为在某一天只能进行一次“买进”或者一次“卖出”活动，即只能进行“一次”交易。

本题的实际意思是：股票交易的最终目标是利益最大化，所以在某一天可以同时进行买进和抛出交易，这样的话，只要保证第二天比前一年的价格高，那么前一天就可以先买进，第二天再卖出，而第二天卖出后，如果第三天的价格更高，那么第二天在抛出后，可以继续在第二天买进。

java代码

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