N-Queens II

最新推荐文章于 2024-09-16 06:54:08 发布

ststns

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量253

点赞数

分类专栏：学习文章标签： leetcode

本文链接：https://blog.csdn.net/ststns/article/details/42677701

版权

学习专栏收录该内容

122 篇文章 0 订阅

订阅专栏

Follow up for N-Queens problem.

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

换汤不换药。。。。

#include <iostream>
#include <vector>
#include <map>
using namespace std;

class Solution {
public:
	bool isValid(vector<int>& indices, int c)
	{
		for(int i=0; i<c;i++){
			if(indices[i]==indices[c]|| (abs(indices[i]-indices[c])==c-i))
				return false;
		}
		return true;
	}
	void nqueens(vector<int>& indices, int c, int n)
	{
		if (c==n){
			count++;
			return;
		}
		for (int i=0; i<n; i++){
			indices[c]=i;
			if(isValid(indices,c))
				nqueens(indices,c+1,n);
		}
	}
    vector<vector<string> > totalNQueens(int n) {
    	count=0;
        vector<int> indices(n,-1);
        nqueens(indices,0,n);
        return count;
    }
private:
    int count;
};