51. N-Queens

class Solution {
private:
    void solve(vector<vector<string>> &result, vector<string> &cur,int row,int n)
    {
        if(row==n)
        {
            result.push_back(cur);
        }
        else
        {
            for(int j=0;j<n;j++)
            {
                if(isvalid(cur,row,j,n))
                {
                    cur[row][j]='Q';
                    solve(result,cur,row+1,n);
                    cur[row][j]='.';
                }
            }
        }
    }
    bool isvalid(vector<string> &cur,int r,int c,int n)
    {
        //检查这一列
        for(int i=0;i<r;i++)
        {
            if(cur[i][c]=='Q')
                return false;
        }
        //检查45度角
        for(int i=r,j=c;i>=0&&j>=0;i--,j--)
        {
            if(cur[i][j]=='Q')
                return false;
        }
        //检查135度角度
        for(int i=r,j=c;i>=0&&j<n;i--,j++)
        {
            if(cur[i][j]=='Q')
                return false;
        }
        return true;
    }
public:
    vector<vector<string>> solveNQueens(int n) {
        vector<vector<string>> result;
        vector<string> cur(n,string(n,'.'));
        solve(result,cur,0,n);
        return result;
    }
};