public int maxProfit1(int[] prices) {
	        // Start typing your Java solution below
	        // DO NOT write main() function
		 if(prices == null || prices.length <= 1) return 0;
		 
		 int maxProfit = subMaxProfit(prices, 0, prices.length-1);
		 for(int i=0; i<prices.length-1; i++){
			 int temp = subMaxProfit(prices, 0, i) + subMaxProfit(prices, i+1, prices.length -1);
			 if(temp > maxProfit) maxProfit = temp; 
		 
		 }
		 
		 return maxProfit;
	    }