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.

二 题目分析

题目 是 在 100的游戏里，两个选手，每个人轮流说出一个数，累计加和，谁说出的数导致和超过目标数或者100，谁就赢。现在是判断第一个选手是否能赢。

首先判断 从1到能选择的最大数之和是否 小于给定的目标值。

然后新建一个状态数组，用0 代表 未选择， 1代表选择。

然后 用一个canWin方法判断第一个选手能否赢，里面参数是 状态数组，目标值，Map数组。

通过回溯法进行求解。

三代码

class Solution {
    public boolean canIWin(int maxChoosableInteger, int desiredTotal) {
        if((1 + maxChoosableInteger) * maxChoosableInteger / 2 < desiredTotal){
			return false;
		}
		int[] state = new int[maxChoosableInteger + 1]; //记录选择状态，0 的话是未选择， 1的话是选择
		return canWin(state,desiredTotal,new HashMap<String,Boolean>());
		

	}
	public boolean canWin(int[] state, int total , Map<String,Boolean>hmap){
		String key = Arrays.toString(state);
		if(hmap.containsKey(key)){  //问题处理过 返回结果
			return hmap.get(key);
		}
		for(int i = 1; i < state.length;i++){
			if(state[i] == 0){
				state[i] = 1;
				if(total - i <= 0 || !canWin(state, total - i,hmap)){ //自己赢或者对方不能赢
					hmap.put(key,true);
					state[i] = 0; //回溯之间变为原来的状态
					return true;
                }
				state[i] = 0;
			}
		}
		hmap.put(key,false);
		return false;
	}
}