AcWing 1621. N 皇后问题
原题链接
简单
作者:
@半岛铁盒
,
2022-11-25 18:42:47
,
所有人可见
,
阅读 236
java 代码
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int K = sc.nextInt();
int[][] arr = new int[K][];
String[] s = new String[K];
for(int i = 0; i < K; i ++){
arr[i] = new int[sc.nextInt()];
int count = 0;
for(int j = 0; j < arr[i].length; j++){
arr[i][j] = sc.nextInt();
if(!isplace(arr,i,j)){
s[i] = "NO";
count++;
}
if(j == arr[i].length - 1 && count == 0){
s[i] = "YES";
}
}
}
for(int i = 0; i < K; i++){
System.out.println(s[i]);
}
}
public static boolean isplace(int[][] arr, int i, int j){
for(int m = 0; m < j; m++){
if(arr[i][m] == arr[i][j] || Math.abs(m-j) == Math.abs(arr[i][m]-arr[i][j])){
return false;
}
}
return true;
}
}