【LeetCode】N-Queens II N皇后问题回溯法

最新推荐文章于 2019-08-09 01:50:00 发布

xiaozhuaixifu

最新推荐文章于 2019-08-09 01:50:00 发布

阅读量1.7k

点赞数

分类专栏： LeetCode 文章标签： leetcode N皇后问题

本文链接：https://blog.csdn.net/xiaozhuaixifu/article/details/21296395

版权

LeetCode 专栏收录该内容

82 篇文章 0 订阅

订阅专栏

N-Queens II

Total Accepted: 4852 Total Submissions: 16065

Follow up for N-Queens problem.

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

Have you been asked this question in an interview?

class Solution {
public:

    int sum;
    int *board;
    
    bool isok(int k) //check whether the kth Queen can be put down.
    {
        for(int i = 1; i < k; i++)
	    {
		if(board[i] == board[k] || abs(i-k) == abs(board[i] - board[k]))
			return false;
	    }
	    return true;
    }
    
    void totalN(int n, int k)
    {
        if(k > n)
            sum++;
        else{
            for(int i = 1; i <= n; i++)
            {
                board[k] = i;
                if(isok(k))
                    totalN(n, k+1);
            }
        }
    }

    int totalNQueens(int n) {
        board = new int[n+1];
        sum = 0;
        totalN(n, 1);
        int res = sum;
        delete []board;
        return res;
    }
};