【leetcode】(python) 121. Best Time to Buy and Sell Stock买卖股票的最佳时机

121. Best Time to Buy and Sell Stock Easy

Description

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

• 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.

题意

有一数组第i个数值代表第i天的股票价格，进行一次买卖以获取最大收益。

解题思路

刚开始以为直接求出最小、最大值就好了，后面发现好多情况不满足题目。其实这题有比较思想，如果后面的最大收益大于前面的最大收益，则需要重新赋值最大收益。

code

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