LeetCode/cpp/51.cpp at master · HONGJICAI/LeetCode · GitHub

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
// simplehash+dfs+9ms.cpp
class Solution {
public:
    vector<vector<string>> solveNQueens(int n) {
        vector<string> r(n, string(n, '.'));
        vector<vector<string>> res;
        unordered_set<int> ver, lTilt, rTilt;
        function<void(int)> dfs = [&](int i) {
            if (i == n) {
                res.push_back(r);
                return;
            }
            for (int j = 0; j < n; ++j)
                if (!ver.contains(j) && !lTilt.contains(i - j) &&
                    !rTilt.contains(i + j)) {
                    ver.insert(j), lTilt.insert(i - j), rTilt.insert(i + j);
                    r[i][j] = 'Q';
                    dfs(i + 1);
                    r[i][j] = '.';
                    ver.erase(j), lTilt.erase(i - j), rTilt.erase(i + j);
                }
        };
        dfs(0);
        return res;
    }
};
// smarthash+dfs+3ms.cpp
class Solution2 {
    vector<int> flag;
    vector<vector<string>> res;
    vector<string> r;
    int n;
    void dfs(int i) {
        if (i == n) {
            res.push_back(r);
            return;
        }
        for (int j = 0; j < n; ++j)
            if (flag[j] && flag[n + i + j] && flag[4 * n + i - j]) {
                flag[j] = flag[n + i + j] = flag[4 * n + i - j] = 0;
                r[i][j] = 'Q';
                dfs(i + 1);
                r[i][j] = '.';
                flag[j] = flag[n + i + j] = flag[4 * n + i - j] = 1;
            }
    }

public:
    vector<vector<string>> solveNQueens(int n) {
        string str(n, '.');
        this->n = n;
        r.assign(n, str);
        flag.assign(5 * n, 1);
        dfs(0);
        return res;
    }
};