Package g0101_0200.s0121_best_time_to_buy_and_sell_stock

Class Solution

java.lang.Object

g0101_0200.s0121_best_time_to_buy_and_sell_stock.Solution

public class Solution
extends Object

121 - Best Time to Buy and Sell Stock.<p>Easy</p> <p>You are given an array <code>prices</code> where <code>prices[i]</code> is the price of a given stock on the <code>ith</code> day.</p> <p>You want to maximize your profit by choosing a <strong>single day</strong> to buy one stock and choosing a <strong>different day in the future</strong> to sell that stock.</p> <p>Return <em>the maximum profit you can achieve from this transaction</em>. If you cannot achieve any profit, return <code>0</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> prices = [7,1,5,3,6,4]</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> prices = [7,6,4,3,1]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> In this case, no transactions are done and the max profit = 0.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= prices.length <= 10⁵</code></li> <li><code>0 <= prices[i] <= 10⁴</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maxProfit(int[] prices)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

maxProfit

public int maxProfit(int[] prices)