728x90 N-Queens II1 [LeetCode] 52. N-Queens II 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 { if (i === N) ans++ // 모든 행에 퀸.. 2023. 12. 22. 이전 1 다음 728x90
