Leetcode 122 买卖股票的最佳时机 II

简单递推, 求一个数列中所有上升队列的差值的和.

python知识点:

1.求list的长度,len(list)

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