leetcode51:N皇后

最新推荐文章于 2024-06-03 22:59:40 发布

恰似惊鸿踏雪泥

最新推荐文章于 2024-06-03 22:59:40 发布

阅读量77

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/SJTU_liangge/article/details/113992117

版权

leetcode 专栏收录该内容

105 篇文章 0 订阅

订阅专栏

class Solution {
public:
    vector<vector<string> > answer;
    void func(vector<string> now,int n){
        int num = now.size();
        if(num == n){
            answer.push_back(now);
            return;
        }
        string a;
        for(int j=0;j<n;j++){
            a+='.';
        }
        for(int j=0;j<n;j++){
            a[j]='Q';
            bool flag=true;
            if(num>0){  
                int i =num-1;
                while(i>=0){
                    if(j-num+i>=0&&now[i][j-num+i]=='Q'){
                        flag=false;
                        break;          
                    }
                    if(j+num-i<n && now[i][j+num-i]=='Q'){
                        flag=false;
                        break;
                    }
                    if(now[i][j]=='Q') {
                        flag=false;
                        break;
                    }
                    i--;
                }
            }
            if(flag){
                now.push_back(a);
                func(now,n);
                now.pop_back();
            }
            a[j]='.';
        }
    }
    vector<vector<string>> solveNQueens(int n) {
        vector<string> now;
        func(now,n);
        return answer;
    }
};