/**
 * 
 */
package com.wangsus.codetest.difficulty3;

/**
 * @author Su
 * 
 *         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 Best_Time_to_Buy_and_Sell_Stock_II {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

	public class Solution {
		public int maxProfit(int[] prices) {
			return 0;
		}
	}
}
