【leetcode---DP】121.est Time to Buy and Sell Stock

嘀嗒嘀嘀嗒嘀

于 2018-05-20 17:45:25 发布

阅读量191

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/ACBattle/article/details/80384050

版权

LeetCode 专栏收录该内容

39 篇文章 1 订阅

订阅专栏

class Solution(object):
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """        
        l = len(prices)
        if l == 0 or l == 1:
            return 0           
        max_pro = 0
        mini = 100000010 
        maxi = 0
        for i in range(0,l-1):
            mini = min(prices[i],mini)
            max_pro = max(max_pro,prices[i+1] - mini)
        return max_pro