❤leetcode,python2❤买卖股票的最佳时机 II

class Solution(object):
def maxProfit(self, prices):
“””
:type prices: List[int]
:rtype: int
“””
zong = 0
for i in range(len(prices)-1):
if prices[i+1]>prices[i]:
zong+= (prices[i+1]-prices[i])
return zong