[Leetcode] N-Queens II

题目：

Follow up for N-Queens problem.

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

思路：回溯法，和N-Queens I基本一样。

class Solution {
public:
    bool is_valid(const vector<vector<int>>& board, int n, int row, int col) {
        for (int i = 0; i < row; ++i) {
            if (board[i][col] == 1) return false;
            if (col - (row - i) >= 0 && board[i][col-(row-i)] == 1) return false;
            if (col + (row - i) < n && board[i][col+(row-i)] == 1) return false;
        }
        return true;
    }
    
    void nqueens_helper(vector<vector<int>>& board, int n, int row, int& sum) {
        if (row == n) {
            sum++;
            return;
        }
        for (int j = 0; j < n; ++j) {
            if (is_valid(board, n, row, j)) {
                board[row][j] = 1;
                nqueens_helper(board, n, row + 1, sum);
                board[row][j] = 0;
            }
        }
    }
    
    int totalNQueens(int n) {
        int sum = 0;
        vector<vector<int>> board(n, vector<int>(n, 0));
        nqueens_helper(board, n, 0, sum);
        return sum;
    }
};

总结：复杂度为O(n!).