[leetcode] predict the winner
来源:互联网 发布:路由器mac地质作用 编辑:程序博客网 时间:2024/06/08 13:46
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: FalseExplanation: 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: TrueExplanation: 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.
A perfect discuss for this solution could be found here.
Assume the length of input is
1. if
suppose the input is:
compare the odd sequence sum with even sequence sum, choose the greater set(you could always do so)
example: [1, 5, 233, 7], odd = 234, even = 12. Choose 1 first, no matter 5 or 7 the opponent is choosing, you could always finish choosing 233 and win.
2. if
define
pay attention here:
Opponent make best moves => gain most profit => ensure we gain less profit
Thus:
Code:
class Solution { vector<vector<int>> dp;public: bool PredictTheWinner(vector<int>& nums) { int N = nums.size(); if (N % 2 == 0) return true; dp.resize(N, vector<int>(N, -1)); int maxprofit = helper(nums, 0, N - 1); return maxprofit * 2 >= accumulate(nums.begin(), nums.end(), 0); } int helper(vector<int> &nums, int i, int j) { if (i > j) return 0; if (dp[i][j] != -1) return dp[i][j]; int choose_i = nums[i] + min(helper(nums, i + 1, j - 1), helper(nums, i + 2, j)); int choose_j = nums[j] + min(helper(nums, i + 1, j - 1), helper(nums, i, j - 2)); return dp[i][j] = max(choose_i, choose_j); }};
阅读全文
0 0
- [leetcode] predict the winner
- [LeetCode] Predict the Winner
- Predict the Winner(leetcode)
- [LeetCode]486. Predict the Winner
- LeetCode 486. Predict the Winner
- [leetcode]486. Predict the Winner
- LeetCode 486. Predict the Winner
- LeetCode 486. Predict the Winner
- leetcode:486. Predict the Winner
- 【Leetcode】486. Predict the Winner
- Leetcode 486. Predict the Winner
- LeetCode 486. Predict the Winner
- LeetCode 486. Predict the Winner
- leetcode 486. Predict the Winner
- leetcode 486. Predict the Winner
- leetcode No486. Predict the Winner
- [LeetCode] 486. Predict the Winner
- Leetcode 486. Predict the Winner
- POJ
- Java:简单的RMI
- 验证码生成及使用
- Activity的生命周期
- 欢迎使用CSDN-markdown编辑器
- [leetcode] predict the winner
- POJ 2739
- HDU
- CodeForces
- JavaWeb环境搭建
- Apache
- 11-散列1 电话聊天狂人 (25分)
- Apache
- java异常分类