《LeetCode力扣练习》代码随想录——回溯算法(解数独—Java)
刷题思路来源于 代码随想录
37. 解数独
-
回溯
class Solution { public void solveSudoku(char[][] board) { backtrack(board); return; } private boolean backtrack(char[][] board) { for (int i = 0; i < 9; i++) { for (int j = 0; j < 9; j++) { if (board[i][j] != '.') { continue; } for (char num = '1'; num <= '9'; num++) { if (isValid(i, j, num, board)) { board[i][j] = num; if (backtrack(board)) { return true; } board[i][j] = '.'; } } return false; } } return true; } private boolean isValid(int i, int j, char num, char[][] board) { for (int row = 0; row < 9; row++) { if (board[row][j] == num) { return false; } } for (int col = 0; col < 9; col++) { if (board[i][col] == num) { return false; } } int startRow = (i / 3) * 3; int startCol = (j / 3) * 3; for (int row = startRow; row < startRow + 3; row++) { for (int col = startCol; col < startCol + 3; col++) { if (board[row][col] == num) { return false; } } } return true; } }