[LeetCode] N-Queens II

最新推荐文章于 2022-06-06 10:35:33 发布

1.02^365的成长裂变

最新推荐文章于 2022-06-06 10:35:33 发布

阅读量3.5k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode1

本文链接：https://blog.youkuaiyun.com/raojunyang/article/details/77925026

LeetCode1 专栏收录该内容

120 篇文章

订阅专栏

本文介绍了一种解决N皇后问题的方法，该方法不仅找出所有可能的棋盘配置，还计算了不同解决方案的总数。通过递归搜索和有效性检查确保放置的皇后不会相互攻击。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

[Problem]

Follow up for N-Queens problem.

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

[LeetCode] N-Queens II - coder007 - Coder007的博客

[Solution]

class Solution {
public:
    // is the new Queen valid
    bool valid(int row, int column, vector<pair<int, int> > &located){
        for(int i = 0; i < located.size(); ++i){
            if(located[i].first + located[i].second == row + column || located[i].second - located[i].first == column - row){
                return false;
            }
        }
        return true;
    }
   
    // search location
    int search(bool column[], int n, int mth, vector<pair<int, int> > &located){
        int res = 0;
   
        // the last row
        if(mth == n - 1){
            for(int i = 0; i < n; ++i){
                if(column[i] == false && valid(mth, i, located)){
                    res++;
                }
            }
        }
        else{
            for(int i = 0; i < n; ++i){
                // valid in the ith column
                if(column[i] == false && valid(mth, i, located)){
   
                    // locate a Queen in (mth, i)
                    column[i] = true;
                    located.push_back(make_pair(mth, i));
   
                    // search in the next row
                    int r = search(column, n, mth+1, located);
                    res += r;
   
                    // back
                    column[i] = false;
                    located.pop_back();
                }
            }
        }
        return res;
    }
   
    // n queen
    int totalNQueens(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
       
        // the columns with Queen
        bool column[n];
        memset(column, false, sizeof(column));
   
        // located Queens
        vector<pair<int, int> > located;
   
        // search
        return search(column, n, 0, located);
    }
};