- Leetcode PHP题解--D109 122. Best T
- leetcode:122. Best Time to Buy a
- [数组]122. Best Time to Buy and Se
- Leetcode122-Best Time to Buy and
- 跟我一起刷leetCode算法题9之Best Time to B
- 121. Best Time to Buy and Sell S
- 【2019-07-30】leetcode(121-130)
- 121. Best Time to Buy and Sell S
- BestTimeToBuyAndSellStock with c
- [2018-11-18] [LeetCode-Week11] 1
题目地址:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/
大意：给定一组股票的价格，要求出最大利润值。例如 [7,1,5,3,6,4] ，最大利润值就是（5-1）+（6-3）。[4,7,8,2,8]就是（8 - 4 +（8 - 2） = 10。但是其实可以是(7 - 4) + (8 - 7) + (8 - 2)，只要后面一个比前面一个大就卖了。
class Solution:
def maxProfit(self, prices):
"""
:type prices: List[int]
:rtype: int
"""
profit = 0
for i in range(1,len(prices)):
if prices[i-1] < prices[i]:
profit += prices[i] - prices[i-1]
return profit
网友评论