Stone Game

Similar Problems:

- LeetCode: Predict the Winner
- CheatSheet: Leetcode For Code Interview
- CheatSheet: Common Code Problems & Follow-ups
- Tag: #game, #minimax, dynamicprogramming

Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i].

The objective of the game is to end with the most stones. The total number of stones is odd, so there are no ties.

Alex and Lee take turns, with Alex starting first. Each turn, a player takes the entire pile of stones from either the beginning or the end of the row. This continues until there are no more piles left, at which point the person with the most stones wins.

Assuming Alex and Lee play optimally, return True if and only if Alex wins the game.

Example 1:

Input: [5,3,4,5] Output: true Explanation: Alex starts first, and can only take the first 5 or the last 5. Say he takes the first 5, so that the row becomes [3, 4, 5]. If Lee takes 3, then the board is [4, 5], and Alex takes 5 to win with 10 points. If Lee takes the last 5, then the board is [3, 4], and Alex takes 4 to win with 9 points. This demonstrated that taking the first 5 was a winning move for Alex, so we return true.

Note:

- 2 <= piles.length <= 500
- piles.length is even.
- 1 <= piles[i] <= 500
- sum(piles) is odd.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

- Solution:

// https://code.dennyzhang.com/stone-game // Basic Ideas: minimax - dynamic programming // f(i, j): max value I can get, if I starts with l[i:j] // f(i+ 1, j), f(i, j-1) // Complexity: Time O(n^2), Space O(n^2) func stoneGame(piles []int) bool { dp := make([][]int, len(piles)) for i, _:= range dp { dp[i] = make([]int, len(piles)) } sums := make([]int, len(piles)) for i, v := range piles { if i == 0 { sums[i] = v } else { sums[i] = sums[i-1] + v } } // from bottom to up for i:=len(piles)-1; i>=0; i-- { // from left to right for j:=i; j<len(piles); j++ { // length with 1 if i == j { dp[i][j] = piles[i] continue } sum := sums[j]-sums[i]+piles[i] v1, v2 := sum-dp[i+1][j], sum-dp[i][j-1] if v1>v2 { dp[i][j] = v1 } else { dp[i][j] = v2 } } } return dp[0][len(piles)-1]*2>=sums[len(piles)-1] }