【贪心】see-122. Best Time to Buy and Sell Stock II

贪心算法求解:

class Solution:
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """
        if prices == [] or len(prices) == 1:
            return 0
        
        ans = 0
        minPrice = prices[0]
        for item in prices:
            if minPrice > item:
                minPrice = item
            else:
                ans += (item-minPrice)
                minPrice = item
        return ans