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 all distinct solutions to the n-queens puzzle.
Each solution contains a distinct board configuration of the n-queens’ placement, where ‘Q’ and ‘.’ both indicate a queen and an empty space respectively.
privatestaticbooleanconfirm(int[] chess){ int col = chess[row]; for (int i = 0; i < row; i++) { if (chess[i] == col || (i + chess[i] == row + col) || i - chess[i] == row - col) returnfalse; } returntrue; }
近期评论