Skip to content
Branch: master
Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.
52. N-Queens II.go
52. N-Queens II_test.go

52. N-Queens 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.


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

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


给定一个整数 n,返回 n 皇后不同的解决方案的数量。


  • 这一题是第 51 题的加强版,在第 51 题的基础上累加记录解的个数即可。
  • 这一题也可以暴力打表法,时间复杂度为 O(1)。
You can’t perform that action at this time.