[leetcode]52. N-Queens II

xiaocong1990

已于 2022-05-29 18:45:56 修改

阅读量217

点赞数

分类专栏：递归图 leetcode 文章标签： leetcode c++ 算法

于 2017-08-02 16:05:25 首次发布

本文链接：https://blog.csdn.net/xiaocong1990/article/details/76580442

版权

leetcode 同时被 3 个专栏收录

473 篇文章 2 订阅

订阅专栏

递归

57 篇文章 0 订阅

订阅专栏

图

29 篇文章 0 订阅

订阅专栏

题目链接：https://leetcode.com/problems/n-queens-ii/description/

Follow up for N-Queens problem.

Now, instead outputting board configurations, return the total number of distinct solutions.

class Solution {
public:
    int totalNQueens(int n) {
        int res= 0;
        std::vector<std::string> nQueens(n, std::string(n, '.'));
        solveNQueens(res, nQueens, 0, n);
        return res;
    }
    
private:
    void solveNQueens(int &res, std::vector<std::string> &nQueens, int row, int &n) {
        if (row == n) {
            res++;
            return;
        }
        for (int col = 0; col != n; ++col)
            if (isValid(nQueens, row, col, n)) {
                nQueens[row][col] = 'Q';
                solveNQueens(res, nQueens, row + 1, n);
                nQueens[row][col] = '.';
            }
    }
    bool isValid(std::vector<std::string> &nQueens, int row, int col, int &n) {
        //check if the column had a queen before.
        for (int i = 0; i != row; ++i)
            if (nQueens[i][col] == 'Q')
                return false;
        //check if the 45° diagonal had a queen before.
        for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; --i, --j)
            if (nQueens[i][j] == 'Q')
                return false;
        //check if the 135° diagonal had a queen before.
        for (int i = row - 1, j = col + 1; i >= 0 && j < n; --i, ++j)
            if (nQueens[i][j] == 'Q')
                return false;
        return true;
    }
};

class Solution {
public:
    int totalNQueens(int n) {
        vector<bool> flag_col(n,true);
        vector<bool> flag_45(2*n-1,true);
        vector<bool> flag_135(2*n-1,true);
        vector<int> nQueens(n,0);
        int count=0;
        dfs(0,nQueens,flag_col,flag_45,flag_135,count,n);
        return count;
    }
private:


    void dfs(int row,vector<int>& nQueens,vector<bool>& flag_col,vector<bool>& flag_45,vector<bool>& flag_135,int &count,int &n)
    {
        if(row==n)
        {
            count++;
            return;
        }
        for(int col=0;col<n;col++)
        {
            if(flag_col[col] && flag_45[row+col] && flag_135[row+n-1-col])
            {
                nQueens[row]=col;
                flag_col[col]=flag_45[row+col]=flag_135[row+n-1-col]=false;
                dfs(row+1,nQueens,flag_col,flag_45,flag_135,count,n);
                flag_col[col]=flag_45[row+col]=flag_135[row+n-1-col]=true;
            }
        }
    }
};