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

思路

上一题的升级版，你可以对股票进行多次买入和卖出，以求获得最大收益，思路来源于leetcode给出的solution
对于一个序列[7, 1, 5, 3, 6, 4]，我们将数值在图上表示，由于数值不是单调地递增或递减而是连续多次波动，因此会有中间的（最大值-最小值）累计之和大于所有的最大值-最小值的（A+B>C)

所以我们只需要将每一段的peak-valley累加即可
代码

class Solution {
    public int maxProfit(int[] prices) {
    int valley=0,peak=0,i=0,sum=0;
    while(i<prices.length-1)//用i来记录位置的变化
    {
     while(prices[i]>=prices[i+1]&&i<prices.length-1)
     {i++;}      
     valley=prices[i];//找最小值
     while(prices[i]<=prices[i+1]&&i<prices.length-1)
     {i++;}
     peak=peices[i];
     sum+=peak-valley;
    } 
    return sum
    }
}