本文主要是介绍464. Can I Win，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
In the “100 game,” two players take turns adding, to a running total, any integer from 1..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 of 1..15 without replacement until they reach a total >= 100.
Given an integer maxChoosableInteger and another integer desiredTotal, determine if the first player to move can force a win, assuming both players play optimally.
You can always assume that maxChoosableInteger will not be larger than 20 and desiredTotal will not be larger than 300.
Example
Input:
maxChoosableInteger = 10
desiredTotal = 11Output:
falseExplanation: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.
bool canWin(int target, int visited, int& maxn, unordered_map<int,bool>& res){if (res.find(visited) != res.end())return res[visited];for (int i = maxn; i >= 1; i--){int mask = (1 << i);if (((mask & visited) == 0) && (i >= target || !(canWin(target - i, visited | mask, maxn, res)))){res[visited] = true;return true;}}res[visited] = false;return false;
}bool canIWin(int maxChoosableInteger, int desiredTotal) {if (maxChoosableInteger >= desiredTotal)return true;if (((maxChoosableInteger + 1) * maxChoosableInteger >> 1) < desiredTotal)return false;unordered_map<int, bool> res;return canWin(desiredTotal, 0, maxChoosableInteger, res);
}这篇关于464. Can I Win的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
