标签：10 integers 464 player Win choose win Leetcode first

Description

In the "100 game" two players take turns adding, to a running total, any integer from 1 to 10. The player who first causes the running total to reach or exceed 100 wins.

What if we change the game so that players cannot re-use integers?

For example, two players might take turns drawing from a common pool of numbers from 1 to 15 without replacement until they reach a total >= 100.

Given two integers maxChoosableInteger and desiredTotal, return true if the first player to move can force a win, otherwise, return false. Assume both players play optimally.

Example

Input: maxChoosableInteger = 10, desiredTotal = 11
Output: false
Explanation:
No matter which integer the first player choose, the first player will lose.
The first player can choose an integer from 1 up to 10.
If the first player choose 1, the second player can only choose integers from 2 up to 10.
The second player will win by choosing 10 and get a total = 11, which is >= desiredTotal.
Same with other integers chosen by the first player, the second player will always win.

Tips

1 <= maxChoosableInteger <= 20
0 <= desiredTotal <= 300

分析

      一个 target 数用可以有多种组合方式。使用最少个数字的组成是我们需要求的，如果是奇数，则是 alice win 否则就是 bob 赢。
比如 n == 20 时，目标数在 1-20 内肯定是 alice win。 目标在 21-39 内肯定是 bob win。依次类推（需要注意的是 ）。
虽然 1-20 内中数字 10 也可以用两个数字 （ 2 +8， 1+9， 来实现，但是组合它的最少数字个数是 1， 所以是 alice win


待实现

总结

标签：10,integers,464,player,Win,choose,win,Leetcode,first
来源： https://www.cnblogs.com/tmortred/p/15257016.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。