【leetcode】(python) 122. Best Time to Buy and Sell Stock II买卖股票的最佳时机II

122. Best Time to Buy and Sell Stock II Easy

Description

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

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

题意

有一数组第i个数值代表第i天股票的价格，通过多次买卖股票来获取最大收益。
要求不能同时进行多次交易，必须在买之前卖掉手中的股票。

解题思路

这题跟121.Best Time to Buy and Sell Stock 有相似而不似之处，相比121题这题可以多次买卖，最后的最大收益就是多次买卖的收益之和。那么怎么确定到底进行了几次买卖呢。找到数据某一区间的极大值和极小值，一次相邻的极大值-极小值就是一次买卖啦。

code

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if prices == []:
            return 0
        max_profit = 0
        d = prices[0]
        u = prices[0]
        i = 0
        while i<len(prices)-1:
            while i<len(prices)-1 and prices[i]>=prices[i+1]:
                i += 1
            d = prices[i]
            while i<len(prices)-1 and prices[i]<=prices[i+1]:
                i += 1
            u = prices[i]
            max_profit += u-d
        return max_profit