mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
46 lines
2.0 KiB
HTML
46 lines
2.0 KiB
HTML
<p>There are some stones in different positions on the X-axis. You are given an integer array <code>stones</code>, the positions of the stones.</p>
|
|
|
|
<p>Call a stone an <strong>endpoint stone</strong> if it has the smallest or largest position. In one move, you pick up an <strong>endpoint stone</strong> and move it to an unoccupied position so that it is no longer an <strong>endpoint stone</strong>.</p>
|
|
|
|
<ul>
|
|
<li>In particular, if the stones are at say, <code>stones = [1,2,5]</code>, you cannot move the endpoint stone at position <code>5</code>, since moving it to any position (such as <code>0</code>, or <code>3</code>) will still keep that stone as an endpoint stone.</li>
|
|
</ul>
|
|
|
|
<p>The game ends when you cannot make any more moves (i.e., the stones are in three consecutive positions).</p>
|
|
|
|
<p>Return <em>an integer array </em><code>answer</code><em> of length </em><code>2</code><em> where</em>:</p>
|
|
|
|
<ul>
|
|
<li><code>answer[0]</code> <em>is the minimum number of moves you can play, and</em></li>
|
|
<li><code>answer[1]</code> <em>is the maximum number of moves you can play</em>.</li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> stones = [7,4,9]
|
|
<strong>Output:</strong> [1,2]
|
|
<strong>Explanation:</strong> We can move 4 -> 8 for one move to finish the game.
|
|
Or, we can move 9 -> 5, 4 -> 6 for two moves to finish the game.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> stones = [6,5,4,3,10]
|
|
<strong>Output:</strong> [2,3]
|
|
<strong>Explanation:</strong> We can move 3 -> 8 then 10 -> 7 to finish the game.
|
|
Or, we can move 3 -> 7, 4 -> 8, 5 -> 9 to finish the game.
|
|
Notice we cannot move 10 -> 2 to finish the game, because that would be an illegal move.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>3 <= stones.length <= 10<sup>4</sup></code></li>
|
|
<li><code>1 <= stones[i] <= 10<sup>9</sup></code></li>
|
|
<li>All the values of <code>stones</code> are <strong>unique</strong>.</li>
|
|
</ul>
|