Skip to content

Latest commit

 

History

History
65 lines (48 loc) · 1.3 KB

0052-n-queens-ii.adoc

File metadata and controls

65 lines (48 loc) · 1.3 KB

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.

0052 8 queens

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.."]
]

解题分析

解题分析参考 N-Queens。

The n-queens puzzle is the problem of placing n queens on an n×_n_ chessboard such that no two queens attack each other.

8 queens

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.."]
]
link:{sourcedir}/_0052_NQueensII.java[role=include]