?

public class NQueue {public static void main(String[] args) {int n = 8;//int limit = n == 32 ? -1 :(1<<n)-1;System.out.println(num2(n));}public static int num2(int n){if(n < 1 || n>32){return 0;}// 1<<n: 1向左移動n位, 這樣1后面有n個零,然后減去1,這樣最右邊就有n個1int limit = n == 32 ? -1 :(1<<n)-1;return process2(limit, 0,0,0);}public static int process2(int limit,int colLim,int leftDiaLim,int rightDiaLim){if(limit == colLim){return 1;}int pos = limit & (~(colLim | leftDiaLim | rightDiaLim));int mostRightOne = 0;int res = 0;while(pos != 0){mostRightOne = pos & (~pos + 1);pos = pos-mostRightOne;int nColLim = colLim+mostRightOne;int nLeftDiaLim = (leftDiaLim+mostRightOne)<<1; // 左移1位int nRightDiaLim = (rightDiaLim+mostRightOne)>>1; // 右移1位res += process2(limit, nColLim,nLeftDiaLim,nRightDiaLim);}return res;} }

?

總結

以上是生活随笔為你收集整理的n皇后问题,使用位运算解决的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。