Package g1601_1700.s1690_stone_game_vii

Class Solution

java.lang.Object
g1601_1700.s1690_stone_game_vii.Solution
public class Solution extends Object
1690 - Stone Game VII.<p>Medium</p> <p>Alice and Bob take turns playing a game, with <strong>Alice starting first</strong>.</p> <p>There are <code>n</code> stones arranged in a row. On each player&rsquo;s turn, they can <strong>remove</strong> either the leftmost stone or the rightmost stone from the row and receive points equal to the <strong>sum</strong> of the remaining stones&rsquo; values in the row. The winner is the one with the higher score when there are no stones left to remove.</p> <p>Bob found that he will always lose this game (poor Bob, he always loses), so he decided to <strong>minimize the score&rsquo;s difference</strong>. Alice&rsquo;s goal is to <strong>maximize the difference</strong> in the score.</p> <p>Given an array of integers <code>stones</code> where <code>stones[i]</code> represents the value of the <code>i<sup>th</sup></code> stone <strong>from the left</strong> , return <em>the <strong>difference</strong> in Alice and Bob&rsquo;s score if they both play <strong>optimally</strong>.</em></p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> stones = [5,3,1,4,2]</p> <p><strong>Output:</strong> 6</p> <p><strong>Explanation:</strong></p> <ul> <li> <p>Alice removes 2 and gets 5 + 3 + 1 + 4 = 13 points. Alice = 13, Bob = 0, stones = [5,3,1,4].</p> </li> <li> <p>Bob removes 5 and gets 3 + 1 + 4 = 8 points. Alice = 13, Bob = 8, stones = [3,1,4].</p> </li> <li> <p>Alice removes 3 and gets 1 + 4 = 5 points. Alice = 18, Bob = 8, stones = [1,4].</p> </li> <li> <p>Bob removes 1 and gets 4 points. Alice = 18, Bob = 12, stones = [4].</p> </li> <li> <p>Alice removes 4 and gets 0 points. Alice = 18, Bob = 12, stones = [].</p> </li> </ul> <p>The score difference is 18 - 12 = 6.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> stones = [7,90,5,1,100,10,10,2]</p> <p><strong>Output:</strong> 122</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == stones.length</code></li> <li><code>2 <= n <= 1000</code></li> <li><code>1 <= stones[i] <= 1000</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • stoneGameVII

      public int stoneGameVII(int[] stones)