D01- leetcode 121. Best Time to Buy and Sell Stock

121. Best Time to Buy and Sell Stock

You are given an array prices where prices[i] is the price of a give stock on the i th day.
You want to maximize your profit by choosing a single day to buy one stock and chooosing a different day in the future to sell that stock.
Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Iterate over all the possible prices you will buy at and all the possible prices you will sell at, with the profit being the sell price minus the buy price. Get the maximum difference.

Class Solution{
	Public int maxProfit(int[] prices){
		//define the a variable for max profit
		int maxProfit = 0;
		//iterating all the possible buying prices
		// buying price starts from price[0]
		for(int i = 0; i < prices.length; i++){
			//iterating all the possible selling prices
			// selling price starts from price[i+1]
			for(int j = i + 1; j < prices.length - 1; j++){
				// computing the profits
				int profit = prices[j] - prices[i];
				if(profit > maxProfit){
					maxProfit = profit;
				}
			}
		}
		return maxProfit;
	}
}