LeetCode OJ - Sudoku Solver

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.

分析：使用DFS穷举，对于每一个空格处：都使用穷举，并判断每一种选择是否可解，否则返回false

class Solution {
public:
    void solveSudoku(vector<vector<char> > &board) {
        DFS(board);
    }
    
    bool DFS(vector<vector<char> > &board) {
        for(int i = 0; i < 9; i++) {
            for(int j = 0; j < 9; j++) {
                if(board[i][j] == '.') {
                    for(int k = 1; k <= 9; k++) {
                        board[i][j] = k + '0';
                        if( isValid(board, i, j) && DFS(board) )
                            return true;
                        board[i][j] = '.';
                    }
                    return false;
                }
                
            }
        }
        return true;
    }
    
    bool isValid(vector<vector<char> > &board, int a, int b) {
        char target = board[a][b];
        for(int i = 0; i < 9; i++) {
            if(i != a && target == board[i][b]) return false;
        }
        
        for(int j = 0; j < 9; j++) {
            if(b != j && target == board[a][j]) return false;
        }
        
        int x = a / 3 * 3;
        int y = b / 3 * 3;
        
        for(int m = 0; m < 3; m++) {
            for(int n = 0; n < 3; n++) {
                if(x+m != a && y+n != b) {
                    if(target == board[x + m][y + n]) return false;
                }
            }
        }
        return true;
    }
};