Predict the Winner

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.

Note:

1. 1 <= length of the array <= 20.
2. Any scores in the given array are non-negative integers and will not exceed 10,000,000.
3. If the scores of both players are equal, then player 1 is still the winner.

解析：使用递归解答，maxscore(nums,left,right)，其中left，right分别为数组中左右下标，若是本次play1选择left点，则play2只能选择（left+1或者right点），play2为了使得分最高会选择让play1得分低的一个点，则play1选left点的最大得分为nums[left]+min(maxscore(nums,left+1,right-1),maxscore(nums,left+2,right))，play1选right点的最大得分为nums[right]+min(maxscore(nums,left,right-2),maxscore(nums,left+1,right-1))，play1选择得分当前决策即是选择得分最高的点。

代码：

class Solution {
public:
    bool PredictTheWinner(vector<int>& nums) {
        if (nums.size()==1) return true;
        if (nums.size()==2) return true;
        int scoresum=0;
        for (int i=0; i<nums.size(); i++)
        {
            scoresum+=nums[i];
        }
        int mascore=maxscore(nums,0,nums.size()-1);
        return mascore>=(scoresum-mascore);
    }
    
    int maxscore(vector<int>&nums,int left,int right)
    {
        if (left==right) return nums[left];
        if (right==(left+1)) return max(nums[left],nums[right]);
        //left
        int leftscore=nums[left];
        leftscore+=(min(maxscore(nums,left+2,right),maxscore(nums,left+1,right-1)));
        int rightscore=nums[right];
        rightscore+=(min(maxscore(nums,left,right-2),maxscore(nums,left+1,right-1)));
        return max(leftscore,rightscore);
    }
};