1.编辑器
我使用的是win10+vscode+leetcode+python3
环境配置参见我的博客:
链接
2.第一百二十二题
(1)题目
英文:
Say you have an array prices for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).
Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).
中文:
给定一个数组,它的第 i 个元素是一支给定股票第 i 天的价格。
设计一个算法来计算你所能获取的最大利润。你可以尽可能地完成更多的交易(多次买卖一支股票)。
注意:你不能同时参与多笔交易(你必须在再次购买前出售掉之前的股票)。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock
(2)解法
① 动态规划
(耗时:92ms,内存:15M)
class Solution:
def maxProfit(self, prices: List[int]) -> int:
res = 0
for i in range(1,len(prices)):
if prices[i]>prices[i-1]:
res += (prices[i]-prices[i-1])
return res
注意:
1.这里没有显示的动态规划,公式为:
dp[i] = dp[i-1] if prices[i]<=prices[i-1] else dp[i-1]+(prices[i]-prices[i-1])
② 遍历
(耗时:84ms,内存:15.1M)
class Solution:
def maxProfit(self, prices: List[int]) -> int:
target = 0
n = len(prices)
i = 0
while i<n-1:
while i<n-1:
if prices[i+1]<prices[i]:
i += 1
else:
break
j = i+1
while j<n-1:
if prices[j+1]>prices[j]:
j+=1
else:
break
if j>n-1:
break
target += (prices[j]-prices[i])
i = j+1
return target