52. N-Queens II

最新推荐文章于 2021-01-22 11:28:53 发布

cravingszy

最新推荐文章于 2021-01-22 11:28:53 发布

阅读量206

点赞数

分类专栏： LeetCode-Java代码

本文链接：https://blog.csdn.net/cravingszy/article/details/51083757

版权

LeetCode-Java代码专栏收录该内容

91 篇文章 0 订阅

订阅专栏

N-Queens II、

跟51. N-Queens I条件一样只是此题求出有多少个解即可

代码

public class Solution {
    Set<Integer> cols = new HashSet<Integer>();
    Set<Integer> diags1 = new HashSet<Integer>();
    Set<Integer> diags2 = new HashSet<Integer>();
    public int totalNQueens(int n) {
        return totalqueens(0, 0, n);
    }
    public int totalqueens(int row, int count,int n) {
        for(int col = 0; col < n; col++){
            if(cols.contains(col)){
                continue;
            }
            int di1 = col - row + n;
            if(diags1.contains(di1)){
                continue;
            }
            int di2 = col + row;
            if(diags2.contains(di2)){
                continue;
            }
            if(row == n-1){
                count++;
            }else {
                cols.add(col);
                diags1.add(di1);
                diags2.add(di2);
                count = totalqueens(row+1, count, n);
                cols.remove(col);
                diags1.remove(di1);
                diags2.remove(di2);
            }
        }
        return count;
    }
}