【leetcode】【122】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).

二、问题分析

与【leetcode】【122】Best Time to Buy and Sell Stock区别在于，可以进行多次交易（先买再卖），还是找那些price骤降的点。

三、Java AC代码

public int maxProfit(int[] prices) {
int currentProfit = 0;
int minIndex = 0;
for (int i = 1; i < prices.length; i++) {
if(prices[i]<prices[minIndex]){
currentProfit += prices[i-1] - prices[minIndex];
minIndex = i;
}
}
return currentProfit;
}