1406. Stone Game III
Description
Alice and Bob continue their games with piles of stones. There are several stones arranged in a row, and each stone has an associated value which is an integer given in the array stoneValue
.
Alice and Bob take turns, with Alice starting first. On each player's turn, that player can take 1
, 2
, or 3
stones from the first remaining stones in the row.
The score of each player is the sum of the values of the stones taken. The score of each player is 0
initially.
The objective of the game is to end with the highest score, and the winner is the player with the highest score and there could be a tie. The game continues until all the stones have been taken.
Assume Alice and Bob play optimally.
Return "Alice"
if Alice will win, "Bob"
if Bob will win, or "Tie"
if they will end the game with the same score.
Example 1:
Input: stoneValue = [1,2,3,7] Output: "Bob" Explanation: Alice will always lose. Her best move will be to take three piles and the score become 6. Now the score of Bob is 7 and Bob wins.
Example 2:
Input: stoneValue = [1,2,3,9] Output: "Alice" Explanation: Alice must choose all the three piles at the first move to win and leave Bob with negative score. If Alice chooses one pile her score will be 1 and the next move Bob's score becomes 5. In the next move, Alice will take the pile with value = 9 and lose. If Alice chooses two piles her score will be 3 and the next move Bob's score becomes 3. In the next move, Alice will take the pile with value = 9 and also lose. Remember that both play optimally so here Alice will choose the scenario that makes her win.
Example 3:
Input: stoneValue = [1,2,3,6] Output: "Tie" Explanation: Alice cannot win this game. She can end the game in a draw if she decided to choose all the first three piles, otherwise she will lose.
Constraints:
1 <= stoneValue.length <= 5 * 10^{4}
1000 <= stoneValue[i] <= 1000
Solutions
Solution 1: Memoization Search
We design a function $dfs(i)$, which represents the maximum score difference that the current player can obtain when playing the game in the range $[i, n)$. If $dfs(0) > 0$, it means that the first player Alice can win; if $dfs(0) < 0$, it means that the second player Bob can win; otherwise, it means that the two players tie.
The execution logic of the function $dfs(i)$ is as follows:
 If $i \geq n$, it means that there are no stones to take now, so we can directly return $0$;
 Otherwise, we enumerate that the current player takes the first $j+1$ piles of stones, where $j \in {0, 1, 2}$. Then the score difference that the other player can get in the next round is $dfs(i + j + 1)$, so the score difference that the current player can get is $\sum_{k=i}^{i+j} stoneValue[k]  dfs(i + j + 1)$. We want to maximize the score difference of the current player, so we can use the $\max$ function to get the maximum score difference, that is:
$$ dfs(i) = \max_{j \in {0, 1, 2}} \left{\sum_{k=i}^{i+j} stoneValue[k]  dfs(i + j + 1)\right} $$
To prevent repeated calculations, we can use memoization search.
The time complexity is $O(n)$, and the space complexity is $O(n)$. Where $n$ is the number of piles of stones.









