Write a program to solve a Sudoku puzzle by filling the empty cells.
Empty cells are indicated by the character '.'
.
You may assume that there will be only one unique solution.
A sudoku puzzle...
...and its solution numbers marked in red.
思路:因为题目保证了输入的board肯定可以填充之后变成soduku,本题又是一个回溯的问题,合理的将值放进去就行。遇到不行时,向上回溯
代码如下(已通过leetcode)
public class Solution {
public void solveSudoku(char[][] board) {
genarateboard(board,0,0);
}
private boolean genarateboard(char[][] board,int row,int col) {
// TODO Auto-generated method stub
if (row == 9) return true;
int next_row = col == 8 ? row + 1 : row;
int next_col = col == 8 ? 0 : col + 1;
if (board[row][col] != '.') {
return genarateboard(board, next_row, next_col);
}
for (int i = 1; i <= 9; i++) {
if (!iscontain(board, row, col, (char)('0'+i))) {
board[row][col] = (char)('0' + i);
if (genarateboard(board, next_row, next_col)) return true;
}
}
board[row][col] = '.';
return false;
}
boolean iscontain(char[][] board,int row,int col,char target) {
boolean flag=false;
for(int i=0;i<board.length;i++){
if(board[i][col]==target) return true;
}
for(int j=0;j<board[row].length;j++){
if(board[row][j]==target) return true;
}
int squarerow=row/3;
int squarecol=col/3;
for(int i=3*squarerow;i<=3*squarerow+2;i++) {
for(int j=3*squarecol;j<=3*squarecol+2;j++) {
if(board[i][j]==target) return true;
}
}
return flag;
}
}