486. 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:
|
|
Example 2:
|
|
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.
题目大意
有两个玩家玩游戏,每一个玩家在数组中第一个数字和最后一个数字选择一个数字,累计最多的则获胜。求第一个玩家是否能够获胜。
解题思路
动态规划
代码
|
|