Sudoku Solver (Java)

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.

Source

 public void solveSudoku(char[][] board) {
        if(board.length == 0)
        	return ;
        
        backtrack(board);
    }
    
    public boolean backtrack(char[][] board){  //找不到回溯结束条件时可将方法返回值写为boolean用作判断条件
    	for(int i = 0; i < 9; i++){
    		for(int j = 0; j < 9; j++){
    			if(board[i][j] == '.'){
    				for(char num = '1'; num <= '9'; num ++){
    					if(isValid(board, i, j, num)){
    						board[i][j] = num;
    						if(!backtrack(board))
    							board[i][j] = '.';
    						else return true;
    					}
    				}
    				return false; //所有数字都尝试失败
    			}
    		}
    	}
    	return true;
    }
    
    public boolean isValid(char[][] board, int i, int j, char c){ //***
    	for(int row = 0; row < 9; row ++){
    		if(board[row][j] == c) return false;
    	}
    	
    	for(int col = 0; col < 9; col ++){
    		if(board[i][col] == c) return false;
    	}
    	
    	for(int row = i / 3 * 3; row < i / 3 * 3 + 3; row ++){  //***
    		for(int col = j / 3 * 3; col < j / 3 * 3 + 3; col ++){ //***
    			if(board[row][col] == c)
    				return false;
    		}
    	}
    	return true;
    }