-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetcode51.cpp
More file actions
138 lines (115 loc) · 3.77 KB
/
Leetcode51.cpp
File metadata and controls
138 lines (115 loc) · 3.77 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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
// Leetcode51.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
#include <vector>
#include <string>
using namespace::std;
vector<vector<string>> solutions;
void findQueens(vector<vector<int>>& all, int queenNum, int size)
{
if (size == queenNum)
{
vector<string> solution;
for (auto line : all)
{
string lineStr = "";
for (auto num : line)
{
if (2 == num)
lineStr.push_back('Q');
else
lineStr.push_back('.');
}
solution.push_back(lineStr);
}
solutions.push_back(solution);
return;
}
for (int col = 0; col < size; ++col)
{
if (!all[queenNum][col])
{
vector<vector<int>> temp = all;
//all[queenNum][col] = 1;
//deal with all
for (int i = 0; i < size; ++i)
{
all[i][col] = 1;
all[queenNum][i] = 1;
if (queenNum - i >= 0 && col - i >= 0)
all[queenNum - i][col - i] = 1;
if (queenNum - i >= 0 && col + i < size)
all[queenNum - i][col + i] = 1;
if (queenNum + i < size && col - i >= 0)
all[queenNum + i][col - i] = 1;
if (queenNum + i < size && col + i < size)
all[queenNum + i][col + i] = 1;
}
all[queenNum][col] = 2;
findQueens(all, queenNum + 1, size);
all = temp;
}
}
}
void findQueensBetter(vector<vector<int>>& all, vector<string>& vStr, int queenNum, int size)
{
if (size == queenNum)
{
solutions.push_back(vStr);
return;
}
for (int col = 0; col < size; ++col)
{
if (!all[queenNum][col])
{
string str(size, '.');
str[col] = 'Q';
vStr.push_back(str);
//deal with all
vector<vector<int>> temp = all;
for (int i = 0; i < size; ++i)
{
all[i][col] = 1;
all[queenNum][i] = 1;
if (queenNum - i >= 0 && col - i >= 0)
all[queenNum - i][col - i] = 1;
if (queenNum - i >= 0 && col + i < size)
all[queenNum - i][col + i] = 1;
if (queenNum + i < size && col - i >= 0)
all[queenNum + i][col - i] = 1;
if (queenNum + i < size && col + i < size)
all[queenNum + i][col + i] = 1;
}
all[queenNum][col] = 2;
findQueensBetter(all, vStr, queenNum + 1, size);
all = temp;
vStr.pop_back();
}
}
}
vector<vector<string>> solveNQueens(int n)
{
vector<vector<int>> all;
vector<int> line(n, 0);
for (int i = 0; i < n; ++i)
all.push_back(line);
//findQueens(all, 0, n);
vector<string> vStr;
findQueensBetter(all, vStr, 0, n);
return solutions;
}
int main()
{
int n = 5;
solveNQueens(n);
std::cout << "Hello World!\n";
}
// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu
// Tips for Getting Started:
// 1. Use the Solution Explorer window to add/manage files
// 2. Use the Team Explorer window to connect to source control
// 3. Use the Output window to see build output and other messages
// 4. Use the Error List window to view errors
// 5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
// 6. In the future, to open this project again, go to File > Open > Project and select the .sln file