LeetCode练题——121. Best Time to Buy and Sell Stock

1、题目

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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

2、我的解答

copy大神

 1 # -*- coding: utf-8 -*-
 2 # @Time    : 2020/3/2 13:33
 3 # @Author  : SmartCat0929
 4 # @Email   : [email protected]
 5 # @Link    : https://github.com/SmartCat0929
 6 # @Site    : 
 7 # @File    : 121. Best Time to Buy and Sell Stock.py
 8 from typing import List
 9 
10 
11 class Solution:
12     def maxProfit(self, prices: List[int]) -> int:
13         lens = len(prices)
14 
15         if lens == 0 or lens == 1:
16             return 0
17 
18         min_price = prices[0]
19         profit = 0
20         for i in range(1, lens):
21             if prices[i] < min_price:
22                 min_price = prices[i]
23             if prices[i] - min_price > profit:
24                 profit = prices[i] - min_price
25         return profit
26 
27 
28 print(Solution().maxProfit([2, 4, 1]))