|
| 1 | +<h2><a href="https://leetcode.com/problems/stone-game-ii/">1140. Stone Game II</a></h2><h3>Medium</h3><hr><p>Alice and Bob continue their games with piles of stones. There are a number of piles <strong>arranged in a row</strong>, and each pile has a positive integer number of stones <code>piles[i]</code>. The objective of the game is to end with the most stones. </p> |
| 2 | + |
| 3 | +<p>Alice and Bob take turns, with Alice starting first. Initially, <code>M = 1</code>.</p> |
| 4 | + |
| 5 | +<p>On each player's turn, that player can take <strong>all the stones</strong> in the <strong>first</strong> <code>X</code> remaining piles, where <code>1 <= X <= 2M</code>. Then, we set <code>M = max(M, X)</code>.</p> |
| 6 | + |
| 7 | +<p>The game continues until all the stones have been taken.</p> |
| 8 | + |
| 9 | +<p>Assuming Alice and Bob play optimally, return the maximum number of stones Alice can get.</p> |
| 10 | + |
| 11 | +<p> </p> |
| 12 | +<p><strong class="example">Example 1:</strong></p> |
| 13 | + |
| 14 | +<pre> |
| 15 | +<strong>Input:</strong> piles = [2,7,9,4,4] |
| 16 | +<strong>Output:</strong> 10 |
| 17 | +<strong>Explanation:</strong> If Alice takes one pile at the beginning, Bob takes two piles, then Alice takes 2 piles again. Alice can get 2 + 4 + 4 = 10 piles in total. If Alice takes two piles at the beginning, then Bob can take all three piles left. In this case, Alice get 2 + 7 = 9 piles in total. So we return 10 since it's larger. |
| 18 | +</pre> |
| 19 | + |
| 20 | +<p><strong class="example">Example 2:</strong></p> |
| 21 | + |
| 22 | +<pre> |
| 23 | +<strong>Input:</strong> piles = [1,2,3,4,5,100] |
| 24 | +<strong>Output:</strong> 104 |
| 25 | +</pre> |
| 26 | + |
| 27 | +<p> </p> |
| 28 | +<p><strong>Constraints:</strong></p> |
| 29 | + |
| 30 | +<ul> |
| 31 | + <li><code>1 <= piles.length <= 100</code></li> |
| 32 | + <li><code>1 <= piles[i] <= 10<sup>4</sup></code></li> |
| 33 | +</ul> |
0 commit comments