题:
解:
1.双循环:
2.动态规划:
代码:
def dp_gupiao (list):
n=len(list)
dp=[0 for i in range(len(list))]
dp[0]=0
minprice=list[0]
maxp=0
i=1
while i<n:
minprice=min(minprice,list[i])
#更新此时的截至最高利润:
print('list[i]-minprice:{}-{}'.format(list[i],minprice))
dp[i]=max(list[i]-minprice,dp[i-1])
print(dp[i],end='<->')
print(maxp,end=':')
maxp=max(maxp,dp[i])
print(maxp)
i += 1
return maxp
结果: