zoukankan      html  css  js  c++  java
  • Python [Leetcode 121]Best Time to Buy and Sell Stock

    题目描述:

    Say you have an array for which the ith element is the price of a given stock on day i.

    If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

    Example 1:

    Input: [7, 1, 5, 3, 6, 4]
    Output: 5
    
    max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
    

    Example 2:

    Input: [7, 6, 4, 3, 1]
    Output: 0
    
    In this case, no transaction is done, i.e. max profit = 0.

    解题思路:

    动态规划,记录最小值的那个值

    代码如下:

    class Solution(object):
        def maxProfit(self, prices):
            """
            :type prices: List[int]
            :rtype: int
            """
            if len(prices) == 0:
                return 0
    
            maxProfit = 0
            minPrice  = prices[0]
            
            for i in range(len(prices)):
                if prices[i] < minPrice:
                    minPrice = prices[i]
                if prices[i] - minPrice > maxProfit:
                    maxProfit = prices[i] - minPrice
    
            return maxProfit
    

      

  • 相关阅读:
    C++ MFC学习 (二)
    C++ MFC字符转换
    C++ MFC学习 (一)
    Windows.h 文件学习
    Git 学习
    Git 学习
    php压缩文件夹并下载到本地
    接口类型无限级分类
    mysql 共享锁 排它锁
    docker基础命令
  • 原文地址:https://www.cnblogs.com/zihaowang/p/5712961.html
Copyright © 2011-2022 走看看