摘要:
http://blog.csdn.net/cxiaokai/article/details/6852706抄袭上述算法:通过每个数只使用一次,来检测是否存在相容解。堆栈最深为100,步骤数 100!输入结束的判断还蛋疼的不能用hasnext() ..import java.util.Scanner;public class Main { static boolean flag = false; static boolean check(int b, int s, int n) { for (int i = n; i > 1; i--) { if ... 阅读全文
摘要:
1 import java.util.Scanner; 2 3 public class Main { 4 static int max = 0; 5 6 static boolean canPut(int x, int y, char[] board, int n) { 7 // up 8 for (int i = x - 1; i >= 0; i--) { 9 if (board[i * n + y] == 'O')10 return false;11 el... 阅读全文