public int maxProfit(int[] prices) {
		if (prices == null || prices.length <= 1)
			return 0;
		int max = 0;
		for (int i = 0; i < prices.length - 1; ++i) {
			if (prices[i + 1] > prices[i]) {
				max += prices[i + 1] - prices[i];
			}
		}
		return max;
	}