leetcode52 N皇后 II

leetcode52 N皇后 II

代码：

class Solution {

    int res = 0;

    boolean check(int[] x,int pos){
        for(int i = 0;i < pos;i++){
            if(x[i] == x[pos] || i-pos == x[i]-x[pos] || i-pos == x[pos]-x[i]) return false;
        }
        return true;
    }

    void backTrack(int pos,int n,int[] x){
        if(pos == n){
            res += 1;
        }else{
            for(int i = 0;i < n;i++){
                x[pos] = i;
                if(check(x,pos)){
                    backTrack(pos+1, n, x);
                }
            }
        }
    }

    public int totalNQueens(int n) {
        int[] x = new int[n];
        backTrack(0, n, x);
        return res;
    }
}

2ms 35.4MB