本文共 856 字，大约阅读时间需要 2 分钟。
题目：
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).
这题区别于121的地方在于，121只要求一次买入一次卖出，而122要求多次买入多次卖出，且交易不可重叠，故122是贪心算法
代码：
class Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ if len(prices)<=1: return 0 maxprofit = 0 for i in range(1,len(prices)): curprofit = prices[i]-prices[i-1] if curprofit>0: maxprofit+=curprofit return maxprofita = Solution()print a.maxProfit([7, 6, 9, 3, 4])
转载地址：http://qzhci.baihongyu.com/