37. 解数独

class Solution {
    public void solveSudoku(char[][] board) {
        solve(board);
    }

    public boolean solve(char[][] board) {
        for (int i = 0; i < board.length; i++) for (int j = 0; j < board[0].length; j++) {
            if (board[i][j] == '.') {
                for (char c = '1'; c <= '9'; c++) {
                    if (isValid(board, i, j ,c)) {
                        board[i][j] = c;
                        if (solve(board))
                            return true;
                        else
                            board[i][j] = '.'; // 把填入的数字抹掉
                    }
                } 
                return false;
            }
        }
        return true;
    }

    public boolean isValid(char[][] board, int i, int j, char c) {
        for (int k = 0; k < 9; k++) {
            if (board[i][k] == c) {
                return false;
            }
            if (board[k][j] == c) {
                return false;
            }
            if (board[3 * (i / 3) + k % 3][3 * (j / 3) + k / 3] == c) {
                return false;
            }
        }
        return true;
    }
}

注：

1. 在36题的基础上面多了解的步骤。可以先看36掌握3x3矩阵的写法。

2. 注意如果不满足条件，要把填入的数字抹掉。