# Best Time to Buy and Sell Stock II

## Problem

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

## Example

Given an example [2,1,2,0,1], return 2

Greedy.

## Code - Java

public class Solution {
public int maxProfit(int[] prices) {
int sum = 0;
int sellIndex = 0;

while (true) {

}

while (sellIndex + 1 < prices.length && prices[sellIndex] < prices[sellIndex + 1]) {
sellIndex++;
}

if (sellIndex >= prices.length || buyIndex >= prices.length) {
break;
}

}

return sum;
}
}
class Solution {
/**
* @param prices: Given an integer array
* @return: Maximum profit
*/
public int maxProfit(int[] prices) {

int sum = 0;
int sellIndex = 0;

while (true) {

}

while (sellIndex + 1 < prices.length && prices[sellIndex] < prices[sellIndex + 1]) {
sellIndex++;
}

if (sellIndex >= prices.length || buyIndex >= prices.length) {
break;
}
}