原題鏈接在這里：https://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).?

題解：

是Best Time to Buy and Sell Stock的進階版，但思路去不同。

這里可以進行無數次交易，當然不能比prices.length - 1還多，就是每次股票比前一天差價大于0都進行交易，把這些大于0的差價相加就是最后返回的結果。

Time Complexity: O(prices.length). Space: O(1).

AC Java:

1 public class Solution { 2 public int maxProfit(int[] prices) { 3 if(prices == null || prices.length <= 1){ 4 return 0; 5 } 6 int res = 0; 7 for(int i = 1; i<prices.length; i++){ 8 res+=Math.max(prices[i]-prices[i-1],0); 9 } 10 return res; 11 } 12 }

?

轉載于:https://www.cnblogs.com/Dylan-Java-NYC/p/4824946.html

總結

以上是生活随笔為你收集整理的LeetCode Best Time to Buy and Sell Stock II的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。