n-queens-ii

Follow up for N-Queens problem.

Now, instead outputting board configurations, return the total number of distinct solutions.

可参考上一篇博客，这里只需要产生一个 可行解，就将计数器count++

import java.util.*;
public class Solution {
    private int count=0;
    public int totalNQueens(int n) {
        int[] cols=new int[n];
        for(int i=0;i<n;i++){
            cols[0]=i;
            dfs(cols,1);
        }
        return count;
    }
    public void dfs(int[] cols,int row){
        if(row==cols.length){
            count++;
            return;
        }
        for(int i=0;i<cols.length;i++){
			if(isOK(cols,row,i)){
                cols[row]=i;
                dfs(cols,row+1);
            }
        }
    }
    public boolean isOK(int[] cols,int row,int col){
        if(cols==null){
            return false;
        }
        for(int i=0;i<row;i++){
            if(col==cols[i]||Math.abs(cols[i]-col)==Math.abs(row-i)){
                return false;
            }
        }
        return true;
    }
}