leetcode: 121. Best Time to Buy and Sell Stock

Difficulty

Easy.

Problem

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.

AC

class Solution():
    def maxProfit(self, prices):
        if not prices:
            return 0
        cur, profit = prices[0], 0
        for ele in prices[1:]:
            diff = ele - cur
            if diff <= 0:
                cur = ele
            else:
                profit = max(diff, profit)
        return profit

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

扫码关注云+社区

领取腾讯云代金券