LeetCode N-Queens II

Follow up for N-Queens problem.

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

这个比N-Queens简单点，但还是一样的

class Solution {
public:
    int totalNQueens(int n) {
        count=0;
        this->N=n;
        memset(matrix,0,sizeof(matrix));
        dfs(0);
        return count;
    }
    int check(int x,int y)
        {
            for(int j=0;j<y;++j)
                if(matrix[x][j]==1)return 0;
            for(int i=0;i<N;++i)
                for(int j=0;j<y;++j)
                {
                    if(abs(i-x)==abs(j-y)&&matrix[i][j]==1)return 0;
                }
            return 1;
        }
    void dfs(int j)
        {
            if(j==N)
            {
                //存储
                count++;
                return ;
            }
            for(int i=0;i<N;++i)
            {
                if(matrix[i][j]==0&&check(i,j))
                {
                    matrix[i][j]=1;
                    dfs(j+1);
                    matrix[i][j]=0;
                }
            }
        }
private :
    int N;
    int count;
    int matrix[100][100];
};