|
| 1 | +<h2><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/">121. Best Time to Buy and Sell Stock</a></h2><h3>Easy</h3><hr><div><p>You are given an array <code>prices</code> where <code>prices[i]</code> is the price of a given stock on the <code>i<sup>th</sup></code> day.</p> |
| 2 | + |
| 3 | +<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> |
| 4 | + |
| 5 | +<p>Return <em>the maximum profit you can achieve from this transaction</em>. If you cannot achieve any profit, return <code>0</code>.</p> |
| 6 | + |
| 7 | +<p> </p> |
| 8 | +<p><strong class="example">Example 1:</strong></p> |
| 9 | + |
| 10 | +<pre><strong>Input:</strong> prices = [7,1,5,3,6,4] |
| 11 | +<strong>Output:</strong> 5 |
| 12 | +<strong>Explanation:</strong> Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. |
| 13 | +Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. |
| 14 | +</pre> |
| 15 | + |
| 16 | +<p><strong class="example">Example 2:</strong></p> |
| 17 | + |
| 18 | +<pre><strong>Input:</strong> prices = [7,6,4,3,1] |
| 19 | +<strong>Output:</strong> 0 |
| 20 | +<strong>Explanation:</strong> In this case, no transactions are done and the max profit = 0. |
| 21 | +</pre> |
| 22 | + |
| 23 | +<p> </p> |
| 24 | +<p><strong>Constraints:</strong></p> |
| 25 | + |
| 26 | +<ul> |
| 27 | + <li><code>1 <= prices.length <= 10<sup>5</sup></code></li> |
| 28 | + <li><code>0 <= prices[i] <= 10<sup>4</sup></code></li> |
| 29 | +</ul> |
| 30 | +</div> |
0 commit comments