leetcode2

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