和八皇后问题类似,横向、纵向、斜角问题判断
方法一:(回溯法)
class Solution {
public void solveSudoku(char[][] board) {
if (board == null || board.length == 0)
return;
solve(board);
}
private boolean solve(char[][] board) {
for (int i = 0; i < board.