本文共 955 字，大约阅读时间需要 3 分钟。

class Solution {//http://www.matrix67.com/blog/archives/266//need more practice, solve N-Queens by bit manipulationpublic:	int cnt,upper;	int totalNQueens(int n) {		// Start typing your C/C++ solution below		// DO NOT write int main() function		cnt = 0;		upper = (1<
   
    >1);			}		}		else ++cnt;	}};
   

second time

class Solution {//always pay attention to do not change the parameters in current level by forwardingpublic:    void solveNQueensUtil(int n, int curRow, int upc, int ld, int rd, int& totalCnt)    {        if(curRow == n)        {            totalCnt++;            return;        }                for(int j = 0; j < n; ++j)        {            int curNum = 1<
   
    >1, (rd|curNum)<<1, totalCnt);        }    }    int totalNQueens(int n) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        int totalCnt = 0;        solveNQueensUtil(n, 0, 0, 0, 0, totalCnt);        return totalCnt;    }};
   

转载地址：http://umxti.baihongyu.com/