LeetCode-37. Sudoku Solverhttps://leetcode.com/problems/sudoku-solver/
题目描述
Write a program to solve a Sudoku puzzle by filling the empty cells.
A sudoku solution must satisfy all of the following rules:
- Each of the digits
1-9
must occur exactly once in each row. - Each of the digits
1-9
must occur exactly once in each column. - Each of the digits
1-9
must occur exactly once in each of the 93x3
sub-boxes of the grid.
The '.'
character indicates empty cells.
Example 1:
Input: board = [["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7",".",".",".","2",".",".",".","6"],[".","6",".",".",".",".","2","8","."],[".",".",".","4","1","9",".",".","5"],[".",".",".",".","8",".",".","7","9"]] Output: [["5","3","4","6","7","8","9","1","2"],["6","7","2","1","9","5","3","4","8"],["1","9","8","3","4","2","5","6","7"],["8","5","9","7","6","1","4","2","3"],["4","2","6","8","5","3","7","9","1"],["7","1","3","9","2","4","8","5","6"],["9","6","1","5","3","7","2","8","4"],["2","8","7","4","1","9","6","3","5"],["3","4","5","2","8","6","1","7","9"]] Explanation: The input board is shown above and the only valid solution is shown below:
Constraints:
board.length == 9
board[i].length == 9
board[i][j]
is a digit or'.'
.- It is guaranteed that the input board has only one solution.
解题思路
【C++】
class Solution {
public:
void solveSudoku(vector<vector<char>>& board) {
row = vector<vector<int>>(9, vector<int>(10));
col = vector<vector<int>>(9, vector<int>(10));
box = vector<vector<int>>(9, vector<int>(10));
for (int i=0; i<9; i++){
for (int j=0; j<9; j++){
if (board[i][j] == '.') continue;
else {
int num = board[i][j]-'0';
row[i][num] = 1;
col[j][num] = 1;
box[(i/3)*3+j/3][num] = 1;
}
}
}
backtracking(board, 0, 0);
}
private:
vector<vector<int>> row, col, box;
bool backtracking(vector<vector<char>>& board, int x, int y){
if (y == 9) return true;
int nx = (x + 1) % 9;
int ny = (nx == 0) ? y + 1 : y;
if (board[y][x] != '.') {return backtracking(board, nx, ny);}
for (int i =1; i<=9; i++) {
int b = (y/3)*3+x/3;
if (!row[y][i] && !col[x][i] && !box[b][i]) {
board[y][x] = i + '0';
row[y][i] = col[x][i] = box[b][i] = 1;
if (backtracking(board, nx, ny)) return true;
board[y][x] = '.';
row[y][i] = col[x][i] = box[b][i] = 0;
}
}
return false;
}
};
【Java】
class Solution {
private boolean[][] row = new boolean[9][10];
private boolean[][] col = new boolean[9][10];
private boolean[][] box = new boolean[9][10];
public void solveSudoku(char[][] board) {
for (int i=0; i<9; i++){
for (int j=0; j<9; j++){
if (board[i][j] == '.') continue;
else {
int num = board[i][j]-'0';
row[i][num] = true;
col[j][num] = true;
box[(i/3)*3+j/3][num] = true;
}
}
}
backtracking(board, 0, 0);
}
private boolean backtracking(char[][] board, int x, int y){
if (y == 9) return true;
int nx = (x + 1) % 9;
int ny = (nx == 0) ? y + 1 : y;
if (board[y][x] != '.') {return backtracking(board, nx, ny);}
for (int i =1; i<=9; i++) {
int b = (y/3)*3+x/3;
if (!row[y][i] && !col[x][i] && !box[b][i]) {
board[y][x] = (char) ('0' + i);
row[y][i] = col[x][i] = box[b][i] = true;
if (backtracking(board, nx, ny)) return true;
board[y][x] = '.';
row[y][i] = col[x][i] = box[b][i] = false;
}
}
return false;
}
}