题目
给定一个数组,它的第 i 个元素是一支给定股票第 i 天的价格。
如果你最多只允许完成一笔交易(即买入和卖出一支股票一次),设计一个算法来计算你所能获取的最大利润。
链接:https://leetcode.com/problems/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 (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:
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.
思路及代码
DP
- 记录迄今为止的最低价和最高利润,先持续更新最低价
- profit = max(profit, prices[i] - low):如果当前价格减去最低价大于记录的利润,则更新利润
# 60ms 85.15%
class Solution:
def maxProfit(self, prices: List[int]) -> int:
if not prices:
return 0
low = prices[0]
profit = 0
for i in range(1, len(prices)):
if prices[i] < low:
low = prices[i]
profit = max(profit, prices[i] - low)
return profit
复杂度
T =
O
(
n
)
O(n)
O(n)
S =
O
(
1
)
O(1)
O(1)