版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_38340127/article/details/89968426
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.."] ]
在原来51题目的基础上求对应的个数，直接在51方法中改为return list的size();（可优化后直接返回个数）