class Solution { public: /** * * @param n int整型 the n * @return int整型 */ int count_ = 0; int Nqueen(int n) { dfs(n, 0, 0, 0, 0); return count_; } void dfs(int n, int row, int shu, int pie, int na){ int available = ((1 << n) - 1) ...