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 = 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.

public class Solution {
    Map<Integer, Boolean> map;
    boolean[] used;
    public boolean canIWin(int maxChoosableInteger, int desiredTotal) {
        if(maxChoosableInteger >= desiredTotal){
            return true;
        }
        //所有的数加起来也没有desired的大就不用算了
        if(maxChoosableInteger*(maxChoosableInteger+1)/2 < desiredTotal){
            return false;
        }
        map = new HashMap();
        used = new boolean[maxChoosableInteger+1];
        return dfs(desiredTotal);
    }
    
    private int format(boolean[] used){
        int num = 0; //将TTTFFF这种东西转成数字，只对T做“与”处理，也就是和1与
        for(boolean b: used){
            if(b) num = num|1;
            num <<= 1;
           
        }
        return num;
    }
    private boolean dfs(int total){
        if(total <= 0){
            return false;
        }
        int key = format(used); 
        if(!map.containsKey(key)){ //如果map里面没有这种状态，加入该状态
            for(int i=1; i<used.length; i++){ //对于每一层，从1开始取值，用没有用过的数。
                if(!used[i]){//这题里面的数用used的长度表示
                    used[i] = true;
                    if(!dfs(total - i)){//如果下一层是false，代表对手肯定输，也就是自己肯定赢
                        map.put(key, true);
                        used[i] = false;
                        return true;
                    }
                    used[i] = false;
                }
            }
            map.put(key, false);
        }
        return map.get(key);//如果map里面有这种状态，直接返回
    }
}