Predict the Winner(leetcode)

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.

本人用动态规划思想解题，时间复杂度和空间复杂度都是O(n2)。

解题思路：

       用二维数组存储过程信息，v[j][i]表示先选数字的人从数字下标是 j 到 i 的序列中所能得到的总和的最大值，最后只要得到v[0][n-1]再和所有数字的和的一半作比较就可以得到结果了。

所以对于一个下标从 j 到 i 的序列，先选的人（我）有两种方法：

      1. 选最前面的数字，此时对手会得到有 v[j+1][i]；

      2. 选最后面的数字，此时对手会得到有 v[j][i-1]；

      对于我的每一个选择，对手也会有两种选择，加起来就是四种。而假设对手是绝顶聪明的，他也会选择对于他来说最优的那一个数，但幸好我是第一个选择的人，所以对手并不能从四种选择中随意挑选。就是说，在我选择之后，然后对手就会把对我来说最坏的一个序列留给我，所以我需要选择的是对手选完后留下在的序列中选择最好的一个数。

      也就是

             max( min(v[j+1][i-1], v[j+2][i]) + nums[j], 

                      min(v[j+1][i-1], v[j][i-2]) + nums[i]);

代码：

    bool PredictTheWinner(vector<int>& nums) {
        int i, j, tmp;
        int l = nums.size();
        if (l == 0) return false;
        vector<vector<int> > v(l, vector<int>(l, 0));
        for (i = 0; i < l; ++i) {
            for (j = i; j >= 0; --j) {
                if (i == j) {
                    v[j][i] = nums[i];
                } else if (i == j + 1) {
                    v[j][i] = max(nums[i], nums[j]);
                } else {
                    v[j][i] = max(min(v[j][i-2], v[j+1][i-1])+nums[i], min(v[j+1][i-1], v[j+2][i])+nums[j]);
                }
            }
        }
        int sum = 0;
        for (i = 0; i < l; ++i)
            sum += nums[i];
        if (sum > 2*v[0][l-1])
            return false;
        return true;
    }