問題描述:股票買進賣出問題(可多次買進賣出)
Paste_Image.png
代碼示例：貪心算法
class Solution(object):
def maxProfit(self, prices):
"""
:type prices: List[int]
:rtype: int
"""
length = len(prices)
if length <= 0: return 0
max_value = 0
for i in range(1,length):
if prices[i] > prices[i-1]:
max_value += prices[i] - prices[i-1]
return max_value
