Created
March 23, 2021 20:10
-
-
Save xmichael446/c2ed93cf1d80ca3856a5d2d15d9d9575 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
bool isValid(vector<vector<int>>& matrix, int x, int y, int val) { | |
for (int j = 0; j < 9; j++) { | |
if (matrix[x][j] == val) return false; | |
} | |
for (int i = 0; i < 9; i++) { | |
if (matrix[i][y] == val) return false; | |
} | |
int smi = x / 3 * 3; | |
int smj = y / 3 * 3; | |
for (int i = 0; i < 3; i++) { | |
for (int j = 0; j < 3; j++) { | |
if (matrix[smi + i][smj + j] == val) return false; | |
} | |
} | |
return true; | |
} | |
bool solveSudoku(vector<vector<int>>& matrix, int i, int j) { | |
if (i == 9) { | |
return true; | |
} | |
int ni = 0, nj = 0; | |
if (j == 8) { | |
ni = i + 1; | |
nj = 0; | |
} else { | |
ni = i; | |
nj = j + 1; | |
} | |
if (matrix[i][j] != 0) { | |
if (solveSudoku(matrix, ni, nj)) return true; | |
} else { | |
for (int po = 1; po <= 9; po++) { | |
if (isValid(matrix, i, j, po)) { | |
matrix[i][j] = po; | |
if (solveSudoku(matrix, ni, nj)) return true; | |
matrix[i][j] = 0; | |
} | |
} | |
} | |
return false; | |
} | |
vector<vector<int>> final(vector<vector<int>>& matrix) { | |
solveSudoku(matrix, 0, 0); | |
return matrix; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment