-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnqueens.cpp
More file actions
59 lines (50 loc) · 1.53 KB
/
Copy pathnqueens.cpp
File metadata and controls
59 lines (50 loc) · 1.53 KB
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
57
58
59
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
bool isSafe(vector<vector<int>>& board, int row, int col, int n) {
for (int i = 0; i < row; i++)
if (board[i][col] == 1)
return false;
for (int i = row, j = col; i >= 0 && j >= 0; i--, j--)
if (board[i][j] == 1)
return false;
for (int i = row, j = col; i >= 0 && j < n; i--, j++)
if (board[i][j] == 1)
return false;
return true;
}
bool solveNQueensUtil(vector<vector<int>>& board, int row, int n) {
if (row >= n)
return true;
for (int col = 0; col < n; col++) {
if (isSafe(board, row, col, n)) {
board[row][col] = 1;
if (solveNQueensUtil(board, row + 1, n))
return true;
board[row][col] = 0;
}
}
return false;
}
void solveNQueens(int n) {
vector<vector<int>> board(n, vector<int>(n, 0));
if (solveNQueensUtil(board, 0, n)) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << (board[i][j] == 1 ? "Q " : ". ");
}
cout << endl;
}
} else {
cout << "No solution exists for " << n << " queens." << endl;
}
}
};
int main() {
Solution solution;
int n = 4; // 4 queens
solution.solveNQueens(n);
return 0;
}