约数倍数选卡片——博弈java实现

记录一下代码： 

import java.util.ArrayList;
import java.util.Scanner;

public class 约数倍数选卡片 {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		String s1 = scanner.nextLine();
		String s2 = scanner.nextLine();
		String[] s1s = s1.split(" ");
		String[] s2s = s2.split(" ");
		ArrayList<Integer> all = new ArrayList();
		int[] now = new int[s2s.length];
		for (int i = 0; i < s1s.length; i++) {
			all.add(Integer.parseInt(s1s[i]));
		}
		for (int i = 0; i < s2s.length; i++) {
			now[i] = Integer.parseInt(s2s[i]);
		}
		
		for (int i = 0; i < now.length; i++) {
			int tmp = all.get(all.lastIndexOf(now[i]));
			int index = all.lastIndexOf(now[i]);
			all.set(index , -1);

			int iswin = dfs(now[i],all);
			if (iswin == 1) {
				System.out.println(now[i]);
				break;
			}

			all.set(index , tmp);
		}
	}
	
	public static int dfs(int x, ArrayList<Integer> all) {
		// 当前拿到的是x
		for (int i = all.size() - 1; i >= 0 ; i--) {
			// 如果可以拿，
			int nownumber = all.get(i);
			if (nownumber >0 && (nownumber % x == 0 || x % nownumber == 0 )) {

				int tmp = all.get(all.lastIndexOf(nownumber));
				int index = all.lastIndexOf(nownumber);
				all.set(index , -1);
				int t = dfs(nownumber, all);

				all.set(index , tmp);
				// 如果下一个是必胜态，当前就是必负态
				if (t == 1) {
					return -1;
				}else if (i == 0) {
					return 1;
				}
			}
		}
		// 如果没有能拿的，就是必输态
		return -1;
	}
}