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 static int maxProfit(int[] prices) {
		int max = 0;
		int i = 0;

		if (prices.length < 2) {
			return 0;
		}

		while (i < prices.length - 1) {
			int base = prices[i];
			while (i < prices.length - 1 && prices[i + 1] >= prices[i]) {
				i++;
			}
			max += prices[i] - base;
			i++;
		}

		return max;
	}