[LeeCode] 121. Best Time to Buy and Sell Stock (Python)

最新推荐文章于 2020-12-22 10:23:53 发布

原创最新推荐文章于 2020-12-22 10:23:53 发布 · 277 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

LeeCode_dynamic programming 专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一种算法，用于确定股票买卖的最佳时机以实现最大利润。通过动态规划的方法，算法能在给定的价格序列中找到最佳买入和卖出点，确保交易一次达到最大收益。

121. Best Time to Buy and Sell Stock

Easy

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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 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
Explanation: In this case, no transaction is done, i.e. max profit = 0.

方法1：动态规划

第i天卖股票能获得的最大利益为dp[i]，buy为已经买的股票的价格

$dp[i]=\left\{\begin{matrix} 0,buy=prices[i]& if& i=0 \\ p[i]-buy,& if &i>0&,prices[i]>buy\\ 0,buy=prices[i]&if&i>0,&prices[i]<=buy \end{matrix}\right.$

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if not prices:
            return 0
        max_profit = 0
        last = prices[0]
        profit = 0
        for i in range(1, len(prices)):
            if prices[i] > last:
                profit = prices[i] - last
            else:
                last = prices[i]
            max_profit = max(max_profit, profit)
        return max_profit