第十一周 动态规划(一)
来源:互联网 发布:淘宝竹鸡打笼 编辑:程序博客网 时间:2024/06/12 13:13
算法题目 : 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.
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.
算法分析:
算法代码(C++):
class Solution {public: bool PredictTheWinner(vector<int>& nums) { return canWin(nums, 0, 0, 1); } bool canWin(vector<int> nums, int sum1, int sum2, int player) { if (nums.empty()) return sum1 >= sum2; if (nums.size() == 1) { if (player == 1) return sum1 + nums[0] >= sum2; else if (player == 2) return sum2 + nums[0] > sum1; } vector<int> va = vector<int>(nums.begin() + 1, nums.end()); vector<int> vb = vector<int>(nums.begin(), nums.end() - 1); if (player == 1) { return !canWin(va, sum1 + nums[0], sum2, 2) || !canWin(vb, sum1 + nums.back(), sum2, 2); } else if (player == 2) { return !canWin(va, sum1, sum2 + nums[0], 1) || !canWin(vb, sum1, sum2 + nums.back(), 1); } }};
阅读全文
0 0
- 第十一周 动态规划(一)
- 第十一周(一):血型
- 第十一周C++作业报告(一)
- 第十一周实验报告(任务一)
- 第十一周项目一(2)
- 第十一周项目一(3)
- 第十一周上机项目一(1)
- 第十一周项目一(2)
- 第十一周上机项目一(2)
- 第十一周上机项目一(3)
- 第十一周项目一(4)
- 第十一周 项目一(3)
- 第十一周项目一(3)
- 第十一周项目一(2)
- 第十一周项目一(2)
- 第十一周项目一(3)
- 第十一周项目一(3)
- 第十一周项目六(一)
- C++编译过程
- 冗余、阈值
- C语言输出负数补码
- 把Qt Designer的ui文件转换为PySide页面文件
- solr<二> Java 操作 solr CURD
- 第十一周 动态规划(一)
- java初学--class extends
- Unity 输出调试信息到界面
- HDOJ 2037 今年暑假不AC (最长的事件序列)
- 证明NP完全问题
- 手机上line-height不起作用
- 线程的几种状态变化
- ECMAScript基础知识
- [Android] 在代码中改控件的高度