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

 

---

 

记忆化dfs。一开始考虑到A先选，只要有一个选择的数返回true就行，B选择时，需要B之后A的每一次返回true，B才能返回true。这里，B选择时返回true的含义和A选择时的true含义是一样的，true代表A赢。

看到别人一种更简洁的方法，A选择时true的含义代表A赢，B选择时true的含义代表B赢，这样能大大简化代码。

以下两种方法。

class Solution {
    public boolean canIWin(int nums, int sum) {
        if(sum==0) return true;
        if((1+nums)*nums/2<sum) return false;
        return dfs(nums,sum,0,new int[1<<20],true);
    }
    boolean dfs(int nums,int sum,int visited,int[] memo,boolean turn){
        if(memo[visited]==1) return true;
        if(memo[visited]==2) return false;
        if(sum<=0){
            if(turn){
                memo[visited]=2;
                return false;
            }
            memo[visited]=1;
            return true;
        }
        for(int i=nums;i>0;i--){
            if(((visited>>(i-1))&1)==1) continue;
            if(turn&&dfs(nums,sum-i,visited|(1<<(i-1)),memo,turn==true?false:true)){//A 一种情况就够了
                memo[visited]=1;
                return true;
            }
            else if(!turn&&!dfs(nums,sum-i,visited|(1<<(i-1)),memo,turn==true?false:true)){ //B 的每种情况都需要要A赢
                memo[visited]=2;  
                return false;
            }
        }
        if(turn){//A true ,B false
            memo[visited]=2;
        }else{
            memo[visited]=1;
        }
        return !turn;
    }
}

 

class Solution {
    public boolean canIWin(int nums, int sum) {
        if(sum==0) return true;
        if((1+nums)*nums/2<sum) return false;
        return dfs(nums,sum,0,new Boolean[1<<nums]);
    }
    boolean dfs(int nums,int sum,int visited,Boolean[] memo){
        if(memo[visited]!=null) return memo[visited];
        if(sum<=0){
            memo[visited]=false;
            return false;
        }
        for(int i=nums;i>0;i--){
            if(((visited>>(i-1))&1)==1) continue;
            if(!dfs(nums,sum-i,visited|(1<<(i-1)),memo)){//A 一种情况就够了
                memo[visited]=true;
                return true;
            }
        }
        memo[visited]=false;
        return false;//A true ,B false
    }
}