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).
无论买卖多少次都可以,不过在下一次买之前必须卖掉,求最大收益:
每当价格上涨就卖掉,代码如下:
class Solution:
def maxProfit(self, prices):
"""
:type prices: List[int]
:rtype: int
"""
maxpro = 0
for i in range(1, len(prices)):
if prices[i] > prices[i-1]:
maxpro += prices[i] - prices[i-1]
return maxpro