原题地址：https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
题意：
Say you have an array 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 (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
解题思路：由于可以进行无限次的交易，那么只要是递增序列，就可以进行利润的累加。
代码：
class Solution: # @param prices, a list of integer # @return an integer def maxProfit(self, prices): maxprofit = 0 for i in range(1, len(prices)): if prices[i] >= prices[i-1]: maxprofit += prices[i] - prices[i-1] return maxprofit
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请联系我们举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/109813.html原文链接：https://javaforall.net
