我希望有一个8皇后问题的递归函数的解决方案。whould,你pleaze帮我吗?感谢。
solve(int rowNo, int totalRows) { if (rowNo>totalRows) dump the board configuration for all the cells in current row if it is possible to place a queen in this cell { place a queen in this cell solve(rowNo+1, totalRows) } }