考虑动态规划,只要第二天的价格贵,那卖了就是赚了,所以转移方程为
dp[i] = dp[i-1] if prices[i-1] >= prices[i] else dp[i-1] + prices[i] - prices[i-1] if prices[i-1] < prices[i]
class Solution(object):
def maxProfit(self, prices):
"""
:type prices: List[int]
:rtype: int
"""
res = 0
for i in range(1, len(prices)):
if prices[i] > prices[i - 1]:
res = res + prices[i] - prices[i - 1]
return res