动态规划之预测赢家

LeetCode 486. Predict the Winner

题目

Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Each time a player picks a number, that number will not be available for the next player. This continues until all the scores have been chosen. The player with the maximum score wins.

Given an array of scores, predict whether player 1 is the winner. You can assume each player plays to maximize his score.

Example 1:

Input:

[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:

[1, 5, 233, 7]

Output:

True

Explanation:

Player 1 first chooses 1. Then player 2 have 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.

分析

预判赢家的题目意思是要将对一串整数，然后让第一个玩家和玩家二轮流在首尾整数中选一个，看能不能选到最后能不能比玩家二的总数大。思路是利用动态规划和循环思想，每次轮流的玩家都选一个时，判断两种选了之后再和选了之后对后面的影响，然后循环下去，如果是玩家2，则将这个数选了之后乘上-1。最后到两个数时就选最大一个返回。如果最终是总和大于等于0，则说明玩家1能赢。关键代码：
int a = turn*nums[s] + winner(nums, s+1, e, -turn);
int b = turn*nums[e] + winner(nums, s, e-1, -turn);
int t = a >= b ? a : b;
return t*turn;
复杂度：时间复杂度，O(n2)，空间复杂度O(n)

代码

class Solution {
public:
    bool PredictTheWinner(vector<int>& nums) {
        return winner(nums, 0, nums.length()-1, 1) >= 0;
    }
    int winner(vector<int> nums, int s, int e, int turn) {
        if (s > e) return -1;
        if (s == e) return turn*nums[s];
        int a = turn*nums[s] + winner(nums, s+1, e, -turn);
        int b = turn*nums[e] + winner(nums, s, e-1, -turn);
        int t = a >= b ? a : b;
        return t*turn;  
    }
}

附

题目地址：LeetCode486