-
Notifications
You must be signed in to change notification settings - Fork 111
/
NQueens.java
54 lines (46 loc) · 1.5 KB
/
NQueens.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int[][] chess = new int[n][n];
printNQueens(chess, "", 0);
}
public static void printNQueens(int[][] chess, String qsf, int row){
if(row == chess.length){
System.out.println(qsf + ".");
return;
}
for(int col = 0; col < chess.length; col++){
if(chess[row][col] == 0 && isQueenSafe(chess, row, col) == true){
chess[row][col] = 1;
printNQueens(chess, qsf + row + "-" + col + ", ", row + 1);
chess[row][col] = 0;
}
}
}
public static boolean isQueenSafe(int[][] chess, int row, int col){
for(int i = row - 1, j = col - 1; i >= 0 && j >= 0; i--, j--){
if(chess[i][j] == 1){
return false;
}
}
for(int i = row - 1, j = col; i >= 0; i--){
if(chess[i][j] == 1){
return false;
}
}
for(int i = row - 1, j = col + 1; i >= 0 && j < chess.length; i--, j++){
if(chess[i][j] == 1){
return false;
}
}
for(int i = row, j = col - 1; j >= 0; j--){
if(chess[i][j] == 1){
return false;
}
}
return true;
}
}