You are given an array prices where prices[i] is the price of a given stock on the ith day.
You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.
Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
Input: prices = [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.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.
Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transactions are done and the max profit = 0.
class Solution(object):
def maxProfit(self, price):
profit = [0] * len(price)
for i in range(1, len(price)):
profit[i] = max(0, price[i] - min(price[0:i]))
return max(profit)
class Solution(object):
def maxProfit(self, price):
if len(price) == 1:
return 0
elif len(price) == 2:
return max(0, price[1] - price[0])
else:
minprice = [0] * len(price)
profit = [0] * len(price)
minprice[0] = 0
profit[0] = 0
minprice[1] = price[0]
profit[1] = max(0, price[1] - minprice[1])
for i in range(2, len(price)):
minprice[i] = min(minprice[i-1], price[i-1])
profit[i] = max(0, price[i] - minprice[i])
return max(profit)
๊ทธ์น๋ง ํจ์จ์ ์ด์ง ์์ ๋ค์ ํ๊ณ ์ถ์๋ค -.- ๋ฌธ์ ๋ฅผ ๋ค์ ์ฝ์ด๋ณด๋ค๊ฐ ์ด๊ฑด ๊ตณ์ด DP๋ก ํ ํ์๊ฐ ์๋ค๋ ๊ฑธ ์์๋ค.
class Solution(object):
def maxProfit(self, price):
minprice = 10000
profit = 0
for i in price:
profit = max(profit, i - minprice)
if i < minprice:
minprice = i
return profit
ํธ-์