leetcode:买卖股票的最佳时机ii

class :
    def maxProfit(self, prices: List[int]) -> int:
        res=0
        for i in range(len(prices)-1):
            if prices[i+1]>prices[i]:
                res+=prices[i+1]-prices[i]
        return res