5. Best Time to Buy and Sell Stock

Topic :

arrays

Difficulty :

easy

Problem Link :

problem statement

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing 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.

Example 1:

Input: prices = [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6),
profit = 6-1 = 5.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transactions are done and the max profit = 0.

solution

import java.io.*;
import java.util.*;
 class Best_Time_to_Buy_and_Sell_Stock
{
   public static void main(String args[])
   {
       int prices[]={7,1,5,3,6,4};
       System.out.println(maxProfit(prices));
    }
   static int maxProfit(int[] prices) {
        int min_sofar=prices[0];
        int max_profit=0;
        for(int i=0;i<prices.length;i++)
            
        {
           min_sofar= Math.min(min_sofar,prices[i]);
            max_profit=Math.max(max_profit,prices[i]-min_sofar);
        }
        return max_profit;
    }
}