LeetCode52 N-Queens II N皇后问题II

问题描述：
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.

Given an integer n, return the number of distinct solutions to the n-queens puzzle.

Example:

Input: 4
Output: 2
Explanation: There are two distinct solutions to the 4-queens puzzle as shown below.
[
 [".Q..",  // Solution 1
  "...Q",
  "Q...",
  "..Q."],

 ["..Q.",  // Solution 2
  "Q...",
  "...Q",
  ".Q.."]
]

题源：here；完整实现：here
思路：
同第51题，所不同的是，这次返回的是有多少种放置方式，代码如下：

class Solution {
public:
    void recurse(vector<string> solution, int pos, vector<vector<bool>> validPos, int& result){
        int n = solution[0].size();
        if (pos == n){
            result++; return;
        }

        for (int i = 0; i < n; i++){
            if (!validPos[pos][i]) continue;

            vector<vector<bool>> newPos = validPos;
            for (int j = pos; j < n; j++){
                newPos[j][i] = false;
                if (i - j + pos >= 0) newPos[j][i - j + pos] = false;
                if (i + j - pos < n) newPos[j][i + j - pos] = false;
            }
            solution[pos][i] = 'Q';

            recurse(solution, pos + 1, newPos, result);
            solution[pos][i] = '.';
        }

        return;
    }

    int totalNQueens(int n) {
        int result = 0;
        vector<string> solution(n, string(n, '.'));
        vector<vector<bool>> validPos = vector<vector<bool>>(n, vector<bool>(n, true));

        recurse(solution, 0, validPos, result);

        return result;
    }
};