zoukankan      html  css  js  c++  java
  • (leetcode题解)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 {
    public:
            map<int,bool> m;       
         bool canIWin(int maxChoosableInteger, int desiredTotal) { int sum=0; if(maxChoosableInteger>desiredTotal) return true; for(int i=1;i<=maxChoosableInteger;i++) sum+=i; if(sum<desiredTotal) return false; return canwin(desiredTotal, maxChoosableInteger,0); } bool canwin(int target,int num,int visited) { if(m.find(visited)!=m.end()) return m[visited]; for(int i=1;i<=num;i++) { int mask=(1<<i); if((mask&visited)==0&&(i>=target||canwin(target-i,num,mask|visited)==false)) { m[visited]=true; return true; } } m[visited]=false; return false; } };


  • 相关阅读:
    hdu 4520 小Q系列故事——最佳裁判 解题报告
    hdu 4505 小Q系列故事——电梯里的爱情 解题报告
    hdu 4524 郑厂长系列故事——逃离迷宫 解题报告
    JAVA泛类型示例
    Perl多进程处理Web日志
    Perl单线程日志分析工具
    Perl DBI使用实例
    JAVA(时间对比排序程序)
    软件通信之HTTP通信协议
    Android中级之网络数据解析一之Json解析
  • 原文地址:https://www.cnblogs.com/kiplove/p/7099293.html
Copyright © 2011-2022 走看看