Package g1101_1200.s1140_stone_game_ii

Class Solution

java.lang.Object
g1101_1200.s1140_stone_game_ii.Solution
public class Solution extends Object
1140 - Stone Game II.<p>Medium</p> <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> <p>Alice and Bob take turns, with Alice starting first. Initially, <code>M = 1</code>.</p> <p>On each player&rsquo;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> <p>The game continues until all the stones have been taken.</p> <p>Assuming Alice and Bob play optimally, return the maximum number of stones Alice can get.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> piles = [2,7,9,4,4]</p> <p><strong>Output:</strong> 10</p> <p><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&rsquo;s larger.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> piles = [1,2,3,4,5,100]</p> <p><strong>Output:</strong> 104</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= piles.length <= 100</code></li> <li><code>1 <= piles[i] <= 10<sup>4</sup></code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • stoneGameII

      public int stoneGameII(int[] piles)