链接:http://leetcode.com/onlinejudge#question_37
原题:
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暴力解决
代码:
class Solution {
public:
void solveSudoku(vector<vector<char> > &board) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
dfs(board, 0);
}
private:
bool dfs(vector<vector<char> > &board, int num) {
int rows = 9;
int cols = 9;
if (num == rows*cols)
return true;
int x = num / cols;
int y = num % cols;
if (board[x][y] != '.')
return dfs(board, num+1);
for (char c='1'; c<='9'; c++) {
if (noConflict(board, x, y, c)) {
board[x][y] = c;
if (dfs(board, num+1))
return true;
board[x][y] = '.';
}
}
return false;
}
bool noConflict(const vector<vector<char> > &board, int x, int y, char c) {
int rows = 9;
int cols = 9;
for (int i=0; i<cols; i++)
if (board[x][i] == c)
return false;
for (int i=0; i<rows; i++)
if (board[i][y] == c)
return false;
int blockX = x / 3;
int blockY = y / 3;
for (int i=0; i<3; i++) {
for (int j=0; j<3; j++) {
int curX = blockX * 3 + i;
int curY = blockY * 3 + j;
if (board[curX][curY] == c)
return false;
}
}
return true;
}
};