Predict the Winner

[leetcode]Predict the Winner

链接：https://leetcode.com/problems/predict-the-winner/description/

Question

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.

Solution

// https://leetcode.com/problems/predict-the-winner/description/
class Solution {
public:
  bool PredictTheWinner(vector<int>& nums) {
    int size = nums.size();
    vector<vector<int> > dp;
    dp.resize(size, vector<int>());
    for (int i = 0; i < size; i++) dp[i].resize(size, 0);
    for (int i = 0; i < size; i++) {
      if (size%2 != 0) dp[i][i] = nums[i];
      else dp[i][i] = -nums[i];
    }
    // 需要注意一下i和j的顺序就好了，根据状态转移方程确定
    for (int i = size-1; i >= 0; i--) {
      for (int j = i+1; j < size; j++) {
        if (size%2 != (j-i)%2) dp[i][j] = max(nums[i]+dp[i+1][j], nums[j]+dp[i][j-1]);
        else dp[i][j] = min(-nums[i]+dp[i+1][j], -nums[j]+dp[i][j-1]);
      }
    }
    return dp[0][size-1] >= 0;
  }
};

int main(int argc, char const *argv[]) {
  vector<int> nums = {0};
  Solution s;
  cout << s.PredictTheWinner(nums) << endl;
  return 0;
}

思路：这是一道博弈题，可以使用动归完成。dp[i][j]表示从i到j本人赢的数量，如果从开始到最后>=0表明赢了。关于转移方程，如果是本人的局（根据剩余个数就可以进行判断）则是要取最大值，如果是对手的局，要取最小值。