Package g0001_0100.s0052_n_queens_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    52 - N-Queens II.

    Hard

    The n-queens puzzle is the problem of placing n queens on an n x 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 1:

    Input: n = 4

    Output: 2

    Explanation: There are two distinct solutions to the 4-queens puzzle as shown.

    Example 2:

    Input: n = 1

    Output: 1

    Constraints:

    • 1 <= n <= 9

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer totalNQueens(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait