【Leetcode】Best Time to Buy and Sell Stock II

题目链接：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).

思路：

可以进行多次交易。只要相邻价格是递增的，我们就赚其中差价，递减的则不操作。

考虑单增、单减、先增后减、先减后增情况下策略都是最优的。

算法：

public int maxProfit(int[] prices) {
int profit = 0;
for (int i = 0; i < prices.length - 1; i++) {
if (prices[i] < prices[i + 1]) {// 只要递增的就赚两者的差价
profit += prices[i + 1] - prices[i];
}
}
return profit;
}