Problem
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 <= length of the array <= 20.
Any scores in the given array are non-negative integers and will not exceed 10,000,000.
If the scores of both players are equal, then player 1 is still the winner.
Solution 1: Recursion
Time complexity: O(2^n)
Space complexity: O(n)
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
// Author: Huahua // Running time: 67 ms class Solution { public: bool PredictTheWinner(vector<int>& nums) { return getScore(nums, 0, nums.size() - 1) >= 0; } private: // Max diff (my_score - op_score) of subarray nums[l] ~ nums[r]. int getScore(vector<int>& nums, int l, int r) { if (l == r) return nums[l]; return max(nums[l] - getScore(nums, l + 1, r), nums[r] - getScore(nums, l, r - 1)); } }; |
Solution 2: Recursion + Memoization
Time complexity: O(n^2)
Space complexity: O(n)
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
// Author: Huahua // Running time: 4 ms class Solution { public: bool PredictTheWinner(vector<int>& nums) { m_ = vector<vector<int>>(nums.size(), vector<int>(nums.size(), INT_MIN)); return getScore(nums, 0, nums.size() - 1) >= 0; } private: vector<vector<int>> m_; // Max diff (my_score - op_score) of subarray nums[l] ~ nums[r]. int getScore(vector<int>& nums, int l, int r) { if (l == r) return nums[l]; if (m_[l][r] != INT_MIN) return m_[l][r]; m_[l][r] = max(nums[l] - getScore(nums, l + 1, r), nums[r] - getScore(nums, l, r - 1)); return m_[l][r]; } }; |
DP version
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
// Author: Huahua // Running time: 4 ms class Solution { public: bool PredictTheWinner(vector<int>& nums) { const int n = nums.size(); vector<vector<int>> dp(n, vector<int>(n, INT_MIN)); for (int i = 0; i < n; ++i) dp[i][i] = nums[i]; for (int l = 2; l <= n; ++l) for (int i = 0; i <= n - l; ++i) { int j = i + l - 1; dp[i][j] = max(nums[i] - dp[i + 1][j], nums[j] - dp[i][j - 1]); } return dp[0][n - 1] >= 0; } }; |
Related Problem
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
huahualeetcode
Be First to Comment