class Solution:
def maxProfit(self, prices: List[int]) -> int:
abs=0
for i in range(len(prices)):
for j in range(i+1,len(prices)):
if abs<(prices[j]-prices[i]) and j>i:
abs=prices[j]-prices[i]
return abs
超时 O(n^2)
class Solution:
def maxProfit(self, prices: List[int]) -> int:
cost,profit=float('+inf'),0
for price in prices:
cost=min(cost,price)
profit=max(profit,price-cost)
return profit
O(n)
float('+inf')表示无穷大
1e-10表示无穷小