Package g0101_0200.s0121_best_time_to_buy_and_sell_stock

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    121 - Best Time to Buy and Sell Stock\.

    Easy

    You are given an array prices where prices[i] is the price of a given stock on the <code>i<sup>th</sup></code> 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.

    Constraints:

    • <code>1 <= prices.length <= 10<sup>5</sup></code>

    • <code>0 <= pricesi<= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxProfit(IntArray prices)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait