public static int maxProfit(int[] prices) {
		if (prices.length <= 0) {
			return 0;
		}
		int lowestPrice = prices[0];
		int maxProfit = 0;
		for (int i = 0; i < prices.length; i++) {
			maxProfit = (prices[i] - lowestPrice) > maxProfit ? (prices[i] - lowestPrice) : maxProfit;
			lowestPrice = prices[i] < lowestPrice ? prices[i] : lowestPrice;
		}
		if (maxProfit < 0) {
			maxProfit = 0;
		}
		return maxProfit;
	}