Leetcode-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).

这一题比较晦涩难懂，我也是参考了别人的博客才做出来的。

不限制交易次数，寻找最大的收益。则两两递增值相加即为最终所求最大收益。

public class Solution {
public int maxProfit(int[] prices) {
int profit = 0;
for(int i=1; i<prices.length; i++){
if(prices[i] > prices[i-1]){
profit += prices[i] - prices[i-1];
}
}
return profit;
}
}