一个小的代码：// stack堆栈中保留两个数据（皇后所在的行和列），总共有八个皇后



// 住要特别注意入栈和出栈的顺序。



最后输出计算的结果。-The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the more general n-queens problem of placing n queens on an n×n chessboard, where solutions exist for all natural numbers n with the exception of n=2 or n=3