解释:动态规划,每个位置 要么加前边序列的最大和,要么重新开始,每次判断找最大的。
class Solution(object):
def kthSmallest(self, nums):
if len(nums) == 0:
return 0
pre = 0
res = -float("inf")
for i in range(len(nums)):
pre = max(pre+nums[i], nums[i])
res = max(res, pre)
return res
题目分析:只能买卖一次,所以在每个时刻卖出时所能获得的利润为当前的价格减去之前的最低价格。
class Solution(object):
def kthSmallest(self, prices):
if len(prices) == 0:
return 0
minprice = prices[0]
stock = 0
for i in range(1, len(prices)):
minprice = min(minprice, prices[i]) # 在i时刻之前的最小的价格
# prices[i]-minprice 在第i个时刻卖出能得到的最大利润
stock = max(stock, prices[i]-minprice) # prices[i]-minprice表示在i时刻卖出的收益,stock是之前的收益
return stock
题目分析:可以有多次买卖,那么每个时刻有两种可能的状态,持有股票和卖出股票
class Solution(object):
def kthSmallest(self, prices):
if len(prices) == 0:
return 0
stock = -prices[0] # 手里有股票
sell = 0 # 手里没有股票
for i in range(1, len(prices)):
stock = max(stock, sell-prices[i])
sell = max(sell, stock+prices[i])
return sell
123. Best Time to Buy and Sell Stock III & 4 还没做,最多有k次交易