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 = 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.
自顶向下DFS,中间保留访问过后的节点值,程序如下所示:
class Solution {
boolean[] visited;
Map<Integer, Boolean> map;
public boolean canIWin(int maxChoosableInteger, int desiredTotal) {
int sum = (1 + maxChoosableInteger)*maxChoosableInteger/2;
if (sum < desiredTotal){
return false;
}
if (desiredTotal <= 0){
return true;
}
visited = new boolean[maxChoosableInteger + 1];
map = new HashMap<>();
return dfs(desiredTotal);
}
public boolean dfs(int desiredTotal){
if (desiredTotal <= 0){
return false;
}
int key = getKey(visited);
if (map.containsKey(key)){
return map.get(key);
}
for (int i = 1; i < visited.length; ++ i){
if (visited[i] == false){
visited[i] = true;
if (!dfs(desiredTotal - i)){
map.put(key, true);
visited[i] = false;
return true;
}
visited[i] = false;
}
}
return false;
}
public int getKey(boolean[] visited){
int res = 0;
for (boolean val : visited){
res = res << 1;
if (val){
res |= 1;
}
}
return res;
}
}