LeetCode486. Predict the Winner——区间dp

最新推荐文章于 2024-07-23 22:06:37 发布

叶卡捷琳堡

最新推荐文章于 2024-07-23 22:06:37 发布

阅读量960

点赞数 16

文章标签：算法数据结构 c++ 开发语言动态规划

本文链接：https://blog.csdn.net/weixin_46841376/article/details/136445614

版权

文章讨论了一个两人游戏问题，玩家1和2交替从数组两端取数加到自己的得分上，直至数组为空。给出了一个动态规划解决方案，预测当双方都采取最优策略时，玩家1能否赢得比赛。

摘要由CSDN通过智能技术生成

文章目录

- 一、题目
- 二、题解

一、题目

You are given an integer array nums. Two players are playing a game with this array: player 1 and player 2.

Player 1 and player 2 take turns, with player 1 starting first. Both players start the game with a score of 0. At each turn, the player takes one of the numbers from either end of the array (i.e., nums[0] or nums[nums.length - 1]) which reduces the size of the array by 1. The player adds the chosen number to their score. The game ends when there are no more elements in the array.

Return true if Player 1 can win the game. If the scores of both players are equal, then player 1 is still the winner, and you should also return true. You may assume that both players are playing optimally.

Example 1:

Input: nums = [1,5,2]
Output: false
Explanation: Initially, player 1 can choose between 1 and 2.
If he chooses 2 (or 1), then player 2 can choose from 1 (or 2) and 5. If player 2 chooses 5, then player 1 will be left with 1 (or 2).
So, final score of player 1 is 1 + 2 = 3, and player 2 is 5.
Hence, player 1 will never be the winner and you need to return false.
Example 2:

Input: nums = [1,5,233,7]
Output: true
Explanation: Player 1 first chooses 1. Then player 2 has to choose between 5 and 7. No matter which number player 2 choose, player 1 can choose 233.
Finally, player 1 has more score (234) than player 2 (12), so you need to return True representing player1 can win.

Constraints:

1 <= nums.length <= 20
0 <= nums[i] <= 107

二、题解

class Solution {
public:
    bool predictTheWinner(vector<int>& nums) {
        int n = nums.size();
        int sum = accumulate(nums.begin(),nums.end(),0);
        vector<vector<int>> dp(n,vector<int>(n,0));
        for(int i = 0;i < n - 1;i++){
            dp[i][i] = nums[i];
            dp[i][i+1] = max(nums[i],nums[i+1]);
        }
        dp[n-1][n-1] = nums[n-1];
        for(int l = n - 3;l >= 0;l--){
            for(int r = l + 2;r < n;r++){
                int c1 = nums[l] + min(dp[l+1][r-1],dp[l+2][r]);
                int c2 = nums[r] + min(dp[l+1][r-1],dp[l][r-2]);
                dp[l][r] = max(c1,c2);
            }
        }
        int first = dp[0][n-1];
        int second = sum - first;
        return first >= second;
    }
};