LeetCode: N-Queens

LeetCode: N-Queens

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
55
56

/**
* Description:
*
* @author hzhou
*/
public class NQueens {
public List<String[]> solveNQueens(int n) {
List<String[]> result = new ArrayList<String[]>();
if (n < 1) {
return result;
}
helper(result, new ArrayList<String>(), 0, n);
return result;
}
private void helper(List<String[]> result, List<String> crt, int row, int n) {
if (row == n) {
result.add(crt.toArray(new String[crt.size()]));
return;
}
for (int i = 0; i < n; i++) {
if (isValid(crt, row, i, n)) {
String s = lineGenerator(i, n);
crt.add(s);
helper(result, crt, row + 1, n);
crt.remove(crt.size() - 1);
}
}
}
private boolean isValid(List<String> crt, int x, int y, int n) {
for (int i = 0; i < x; i++) {
int offSet = x - i;
if (crt.get(i).charAt(y) == 'Q') {
return false;
}
if (y - offSet >= 0 && crt.get(i).charAt(y - offSet) == 'Q') {
return false;
}
if (y + offSet < n && crt.get(i).charAt(y + offSet) == 'Q') {
return false;
}
}
return true;
}
private String lineGenerator(int x, int n) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < n; i++) {
if (i == x) {
sb.append('Q');
} else {
sb.append('.');
}
}
return sb.toString();
}
}