zoukankan      html  css  js  c++  java
  • 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.
    
    class Solution { //巧妙地利用位运算来储存那些数字被访问过
    private:
        int maxn;
        map<int, bool> m;
    public:
        bool canIWin(int maxChoosableInteger, int desiredTotal) {
            maxn = maxChoosableInteger;
            if(maxn >= desiredTotal) return true;
            if((1 + maxn) * maxn / 2 < desiredTotal) return false;
            return canWin(desiredTotal, 0);
        }
        bool canWin(int target, int visited) {
            if(m.find(visited) != m.end()) return m[visited];
            for(int i = 1; i <= maxn; i++) {
                int mask = (1 << i);
                if((mask & visited) == 0 && (i >= target || canWin(target - i, mask | visited) == false)) {
                    m[visited] = true;
                    return true;
                }
            }
            m[visited] = false;
            return false;
        }
    };
    
  • 相关阅读:
    2015 ACM/ICPC Asia Regional Changchun Online HDU 5444 Elven Postman【二叉排序树的建树和遍历查找】
    JDBC连接MySQL数据库
    MySQL实习训练1
    I Hate It
    Just a Hook
    Mayor's posters
    asd的甩锅计划
    程序员的恋情
    Radical and array
    Highways
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/10067396.html
Copyright © 2011-2022 走看看