leetCode 51. N-Queens | 回溯问题(N皇后问题) | hard

51. 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.数据结构 Given an integer n, return all distinct solutions to the n-que

>>阅读原文<<