N皇后问题C++实现

最新推荐文章于 2026-06-21 01:22:40 发布

原创最新推荐文章于 2026-06-21 01:22:40 发布 · 171 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++ #算法 #c语言

收录于

#include <iostream>
#include <vector>
#include <string>

using namespace std;

bool is_valid(vector<string>& board, int row, int col) {
    // Check same column
    for (int i = 0; i < row; i++) {
        if (board[i][col] == 'Q') {
            return false;
        }
    }
    // Check upper right diagonal
    for (int i = row - 1, j = col + 1; i >= 0 && j < board.size(); i--, j++) {
        if (board[i][j] == 'Q') {
            return false;
        }
    }
    // Check upper left diagonal
    for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; i--, j--) {
        if (board[i][j] == 'Q') {
            return false;
        }
    }
    return true;
}

void backtrack(vector<string>& board, int row, vector<vector<string>>& res) {
    if (row == board.size()) {
        res.push_back(board);
        return;
    }
    for (int col = 0; col < board.size(); col++) {
        if (is_valid(board, row, col)) {
            board[row][col] = 'Q';
            backtrack(board, row + 1, res);
            board[row][col] = '.';
        }
    }
}

vector<vector<string>> solve_n_queens(int n) {
    vector<string> board(n, string(n, '.'));
    vector<vector<string>> res;
    backtrack(board, 0, res);
    return res;
}

int main() {
    int n;
    cin >> n;
    vector<vector<string>> res = solve_n_queens(n);
    cout << res.size() << endl;
    return 0;
}