[leetcode 20] N-Queens II

题目：

Follow up for N-Queens problem.

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

思路：

1.同N-Queens

代码：

class Solution{
public:
	int result;
	int totalNQueens(int n)
	{
		result=0;
		vector<int> num(n,-1);
		dfs(num,0);
		return result;
	}
private:
	void dfs(vector<int> &num,int cur)
	{
		if(cur==num.size())
		{
			++result;
			return;
		}
		for(int i=0;i!=num.size();++i)
		{
			if(check(num,cur,i))
			{
				num[cur]=i;
				dfs(num,cur+1);
			}
		}
	}
	bool check(vector<int> &num,int cur,int val)
	{
		for(int i=0;i!=cur;++i)
		{
			if(num[i]==val)
				return false;
			if(i+num[i]==val+cur)
				return false;
			if(i-num[i]==cur-val)
				return false;
		}
		return true;
	}
};