Leetcode 121. Best Time to Buy and Sell Stock
AppleAtlassianAudibleBloombergByteDanceExpediaGoldman SachsMicrosoftWalmart LabsZillowamazonarraydynamic programmingfacebookgoogleleetcodeoracleuber알고리즘자료구조
0
알고리즘 문제풀이(Leetcode)
목록 보기
4/42
class Solution:
def maxProfit(self, prices: List[int]) -> int:
maxProfit, minPrice = 0, float('inf')
for i in range(len(prices)):
minPrice = min(minPrice, prices[i])
profit = prices[i] - minPrice
maxProfit = max(maxProfit, profit)
return maxProfit